./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/float_req_bl_1252b.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/float-newlib/float_req_bl_1252b.c', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux', '--witnessprinter.witness.filename', 'witness', '--witnessprinter.write.witness.besides.input.file', 'false', '--witnessprinter.graph.data.specification', 'CHECK( init(main()), LTL(G ! call(reach_error())) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', 'c12eaf00463983fc4c27f56efba3b68bea09d23ae311c93edfb6c8bce7a55280'] 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/float-newlib/float_req_bl_1252b.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c12eaf00463983fc4c27f56efba3b68bea09d23ae311c93edfb6c8bce7a55280 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-06 21:10:07,397 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 21:10:07,501 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-06 21:10:07,506 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 21:10:07,506 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 21:10:07,524 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 21:10:07,525 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 21:10:07,525 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 21:10:07,525 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 21:10:07,525 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 21:10:07,525 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 21:10:07,525 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 21:10:07,526 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 21:10:07,526 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 21:10:07,526 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 21:10:07,526 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 21:10:07,526 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 21:10:07,526 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-06 21:10:07,527 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-06 21:10:07,527 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-06 21:10:07,527 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 21:10:07,527 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 21:10:07,527 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 21:10:07,527 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 21:10:07,527 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 21:10:07,527 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-06 21:10:07,527 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 21:10:07,528 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 21:10:07,528 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 21:10:07,528 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 21:10:07,528 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 21:10:07,528 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 21:10:07,528 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 21:10:07,528 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 21:10:07,529 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 21:10:07,529 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 21:10:07,529 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-06 21:10:07,529 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-06 21:10:07,529 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 21:10:07,529 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 21:10:07,529 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 21:10:07,529 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 21:10:07,530 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 -> c12eaf00463983fc4c27f56efba3b68bea09d23ae311c93edfb6c8bce7a55280 [2024-11-06 21:10:07,829 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 21:10:07,837 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 21:10:07,839 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 21:10:07,840 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 21:10:07,840 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 21:10:07,841 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1252b.c [2024-11-06 21:10:09,132 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 21:10:09,337 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 21:10:09,338 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1252b.c [2024-11-06 21:10:09,344 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/42bfc81e7/497aaf999c71442b8c1c9ca1ff12b3b4/FLAGdceb55f80 [2024-11-06 21:10:09,360 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/42bfc81e7/497aaf999c71442b8c1c9ca1ff12b3b4 [2024-11-06 21:10:09,363 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 21:10:09,365 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-06 21:10:09,367 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 21:10:09,368 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 21:10:09,372 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 21:10:09,373 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:10:09" (1/1) ... [2024-11-06 21:10:09,375 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8a87082 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:10:09, skipping insertion in model container [2024-11-06 21:10:09,375 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:10:09" (1/1) ... [2024-11-06 21:10:09,389 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 21:10:09,541 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/float-newlib/float_req_bl_1252b.c[1936,1949] [2024-11-06 21:10:09,546 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 21:10:09,556 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 21:10:09,581 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/float-newlib/float_req_bl_1252b.c[1936,1949] [2024-11-06 21:10:09,582 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 21:10:09,594 INFO L204 MainTranslator]: Completed translation [2024-11-06 21:10:09,595 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:10:09 WrapperNode [2024-11-06 21:10:09,595 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 21:10:09,596 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 21:10:09,597 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 21:10:09,597 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 21:10:09,602 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:10:09" (1/1) ... [2024-11-06 21:10:09,613 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:10:09" (1/1) ... [2024-11-06 21:10:09,632 INFO L138 Inliner]: procedures = 18, calls = 19, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 63 [2024-11-06 21:10:09,633 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 21:10:09,634 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 21:10:09,634 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 21:10:09,635 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 21:10:09,642 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:10:09" (1/1) ... [2024-11-06 21:10:09,643 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:10:09" (1/1) ... [2024-11-06 21:10:09,646 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:10:09" (1/1) ... [2024-11-06 21:10:09,665 INFO L175 MemorySlicer]: Split 6 memory accesses to 3 slices as follows [2, 2, 2]. 33 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2024-11-06 21:10:09,666 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:10:09" (1/1) ... [2024-11-06 21:10:09,666 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:10:09" (1/1) ... [2024-11-06 21:10:09,674 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:10:09" (1/1) ... [2024-11-06 21:10:09,681 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:10:09" (1/1) ... [2024-11-06 21:10:09,684 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:10:09" (1/1) ... [2024-11-06 21:10:09,689 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:10:09" (1/1) ... [2024-11-06 21:10:09,690 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 21:10:09,691 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 21:10:09,691 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 21:10:09,691 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 21:10:09,696 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:10:09" (1/1) ... [2024-11-06 21:10:09,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 21:10:09,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 21:10:09,732 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-06 21:10:09,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-06 21:10:09,757 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 21:10:09,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-06 21:10:09,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-06 21:10:09,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-06 21:10:09,757 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-06 21:10:09,757 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_float [2024-11-06 21:10:09,757 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_float [2024-11-06 21:10:09,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-06 21:10:09,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-06 21:10:09,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-06 21:10:09,758 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 21:10:09,758 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 21:10:09,758 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-06 21:10:09,758 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-06 21:10:09,758 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-06 21:10:09,758 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-06 21:10:09,834 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 21:10:09,836 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 21:10:10,004 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-11-06 21:10:10,004 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 21:10:10,012 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 21:10:10,012 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-06 21:10:10,013 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:10:10 BoogieIcfgContainer [2024-11-06 21:10:10,013 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 21:10:10,015 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 21:10:10,015 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 21:10:10,020 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 21:10:10,020 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:10:09" (1/3) ... [2024-11-06 21:10:10,021 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a1f3fb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:10:10, skipping insertion in model container [2024-11-06 21:10:10,021 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:10:09" (2/3) ... [2024-11-06 21:10:10,021 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a1f3fb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:10:10, skipping insertion in model container [2024-11-06 21:10:10,021 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:10:10" (3/3) ... [2024-11-06 21:10:10,022 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_1252b.c [2024-11-06 21:10:10,035 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 21:10:10,035 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 21:10:10,083 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 21:10:10,095 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;@c275907, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 21:10:10,096 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 21:10:10,101 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 25 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-06 21:10:10,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-06 21:10:10,107 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 21:10:10,108 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 21:10:10,109 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 21:10:10,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 21:10:10,114 INFO L85 PathProgramCache]: Analyzing trace with hash -160972861, now seen corresponding path program 1 times [2024-11-06 21:10:10,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 21:10:10,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208565770] [2024-11-06 21:10:10,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 21:10:10,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 21:10:10,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 21:10:10,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 21:10:10,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 21:10:10,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 21:10:10,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 21:10:10,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208565770] [2024-11-06 21:10:10,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208565770] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 21:10:10,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 21:10:10,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 21:10:10,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747537955] [2024-11-06 21:10:10,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 21:10:10,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 21:10:10,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 21:10:10,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 21:10:10,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 21:10:10,303 INFO L87 Difference]: Start difference. First operand has 29 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 25 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-06 21:10:10,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 21:10:10,335 INFO L93 Difference]: Finished difference Result 55 states and 80 transitions. [2024-11-06 21:10:10,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 21:10:10,339 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-11-06 21:10:10,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 21:10:10,344 INFO L225 Difference]: With dead ends: 55 [2024-11-06 21:10:10,344 INFO L226 Difference]: Without dead ends: 26 [2024-11-06 21:10:10,346 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 21:10:10,348 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 1 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 21:10:10,349 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 65 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 21:10:10,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-06 21:10:10,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-11-06 21:10:10,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-06 21:10:10,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2024-11-06 21:10:10,383 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 14 [2024-11-06 21:10:10,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 21:10:10,383 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2024-11-06 21:10:10,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-06 21:10:10,384 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2024-11-06 21:10:10,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-06 21:10:10,384 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 21:10:10,384 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 21:10:10,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-06 21:10:10,385 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 21:10:10,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 21:10:10,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1856750492, now seen corresponding path program 1 times [2024-11-06 21:10:10,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 21:10:10,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749999069] [2024-11-06 21:10:10,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 21:10:10,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 21:10:10,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 21:10:10,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 21:10:10,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 21:10:10,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 21:10:10,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 21:10:10,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749999069] [2024-11-06 21:10:10,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749999069] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 21:10:10,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 21:10:10,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-06 21:10:10,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359080148] [2024-11-06 21:10:10,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 21:10:10,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-06 21:10:10,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 21:10:10,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-06 21:10:10,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-06 21:10:10,655 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-06 21:10:10,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 21:10:10,699 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2024-11-06 21:10:10,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-06 21:10:10,700 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-11-06 21:10:10,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 21:10:10,701 INFO L225 Difference]: With dead ends: 39 [2024-11-06 21:10:10,701 INFO L226 Difference]: Without dead ends: 30 [2024-11-06 21:10:10,702 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-06 21:10:10,702 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 1 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 21:10:10,703 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 107 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 21:10:10,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-06 21:10:10,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-11-06 21:10:10,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-06 21:10:10,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2024-11-06 21:10:10,713 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 15 [2024-11-06 21:10:10,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 21:10:10,713 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2024-11-06 21:10:10,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-06 21:10:10,714 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2024-11-06 21:10:10,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-06 21:10:10,714 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 21:10:10,714 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 21:10:10,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-06 21:10:10,714 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 21:10:10,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 21:10:10,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1502968870, now seen corresponding path program 1 times [2024-11-06 21:10:10,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 21:10:10,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914576941] [2024-11-06 21:10:10,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 21:10:10,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 21:10:10,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 21:10:10,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 21:10:10,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 21:10:10,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 21:10:10,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 21:10:10,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914576941] [2024-11-06 21:10:10,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914576941] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 21:10:10,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 21:10:10,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-06 21:10:10,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349806434] [2024-11-06 21:10:10,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 21:10:10,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-06 21:10:10,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 21:10:10,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-06 21:10:10,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-06 21:10:10,874 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-06 21:10:10,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 21:10:10,916 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2024-11-06 21:10:10,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-06 21:10:10,917 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-11-06 21:10:10,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 21:10:10,918 INFO L225 Difference]: With dead ends: 43 [2024-11-06 21:10:10,918 INFO L226 Difference]: Without dead ends: 34 [2024-11-06 21:10:10,919 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-06 21:10:10,919 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 1 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 21:10:10,920 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 123 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 21:10:10,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-06 21:10:10,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2024-11-06 21:10:10,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-06 21:10:10,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2024-11-06 21:10:10,925 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 16 [2024-11-06 21:10:10,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 21:10:10,926 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2024-11-06 21:10:10,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-06 21:10:10,926 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2024-11-06 21:10:10,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-06 21:10:10,926 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 21:10:10,926 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 21:10:10,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-06 21:10:10,926 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 21:10:10,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 21:10:10,927 INFO L85 PathProgramCache]: Analyzing trace with hash -359796568, now seen corresponding path program 1 times [2024-11-06 21:10:10,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 21:10:10,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651599519] [2024-11-06 21:10:10,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 21:10:10,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 21:10:10,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 21:10:11,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 21:10:11,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 21:10:11,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 21:10:11,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 21:10:11,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651599519] [2024-11-06 21:10:11,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651599519] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 21:10:11,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 21:10:11,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-06 21:10:11,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223505919] [2024-11-06 21:10:11,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 21:10:11,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-06 21:10:11,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 21:10:11,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-06 21:10:11,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-06 21:10:11,108 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-06 21:10:11,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 21:10:11,155 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2024-11-06 21:10:11,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-06 21:10:11,158 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-11-06 21:10:11,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 21:10:11,158 INFO L225 Difference]: With dead ends: 43 [2024-11-06 21:10:11,158 INFO L226 Difference]: Without dead ends: 34 [2024-11-06 21:10:11,158 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-06 21:10:11,159 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 1 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 21:10:11,159 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 123 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 21:10:11,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-06 21:10:11,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2024-11-06 21:10:11,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-06 21:10:11,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2024-11-06 21:10:11,166 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 17 [2024-11-06 21:10:11,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 21:10:11,166 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2024-11-06 21:10:11,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-06 21:10:11,166 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2024-11-06 21:10:11,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-06 21:10:11,167 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 21:10:11,167 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 21:10:11,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-06 21:10:11,167 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 21:10:11,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 21:10:11,170 INFO L85 PathProgramCache]: Analyzing trace with hash -910833558, now seen corresponding path program 1 times [2024-11-06 21:10:11,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 21:10:11,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734147020] [2024-11-06 21:10:11,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 21:10:11,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 21:10:11,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 21:10:11,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 21:10:11,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 21:10:11,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 21:10:11,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 21:10:11,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734147020] [2024-11-06 21:10:11,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734147020] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 21:10:11,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 21:10:11,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-06 21:10:11,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198728454] [2024-11-06 21:10:11,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 21:10:11,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-06 21:10:11,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 21:10:11,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-06 21:10:11,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-06 21:10:11,296 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-06 21:10:11,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 21:10:11,331 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2024-11-06 21:10:11,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-06 21:10:11,331 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2024-11-06 21:10:11,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 21:10:11,332 INFO L225 Difference]: With dead ends: 43 [2024-11-06 21:10:11,332 INFO L226 Difference]: Without dead ends: 34 [2024-11-06 21:10:11,332 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-06 21:10:11,333 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 1 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 21:10:11,333 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 123 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 21:10:11,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-06 21:10:11,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2024-11-06 21:10:11,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-06 21:10:11,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2024-11-06 21:10:11,340 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 18 [2024-11-06 21:10:11,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 21:10:11,341 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2024-11-06 21:10:11,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-06 21:10:11,342 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2024-11-06 21:10:11,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-06 21:10:11,343 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 21:10:11,343 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 21:10:11,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-06 21:10:11,343 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 21:10:11,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 21:10:11,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1576679275, now seen corresponding path program 1 times [2024-11-06 21:10:11,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 21:10:11,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347970442] [2024-11-06 21:10:11,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 21:10:11,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 21:10:11,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-06 21:10:11,365 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-06 21:10:11,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-06 21:10:11,393 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-06 21:10:11,393 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-06 21:10:11,394 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-06 21:10:11,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-06 21:10:11,403 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-06 21:10:11,422 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-06 21:10:11,426 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 09:10:11 BoogieIcfgContainer [2024-11-06 21:10:11,426 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-06 21:10:11,427 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-06 21:10:11,427 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-06 21:10:11,428 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-06 21:10:11,428 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:10:10" (3/4) ... [2024-11-06 21:10:11,430 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-06 21:10:11,431 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-06 21:10:11,433 INFO L158 Benchmark]: Toolchain (without parser) took 2066.55ms. Allocated memory is still 100.7MB. Free memory was 76.8MB in the beginning and 43.5MB in the end (delta: 33.3MB). Peak memory consumption was 29.8MB. Max. memory is 16.1GB. [2024-11-06 21:10:11,435 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 83.9MB. Free memory is still 47.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-06 21:10:11,435 INFO L158 Benchmark]: CACSL2BoogieTranslator took 228.01ms. Allocated memory is still 100.7MB. Free memory was 76.6MB in the beginning and 65.2MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-06 21:10:11,435 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.92ms. Allocated memory is still 100.7MB. Free memory was 65.2MB in the beginning and 63.9MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-06 21:10:11,435 INFO L158 Benchmark]: Boogie Preprocessor took 56.56ms. Allocated memory is still 100.7MB. Free memory was 63.9MB in the beginning and 62.3MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-06 21:10:11,435 INFO L158 Benchmark]: RCFGBuilder took 321.49ms. Allocated memory is still 100.7MB. Free memory was 62.3MB in the beginning and 49.7MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-06 21:10:11,436 INFO L158 Benchmark]: TraceAbstraction took 1411.64ms. Allocated memory is still 100.7MB. Free memory was 49.0MB in the beginning and 43.5MB in the end (delta: 5.6MB). Peak memory consumption was 4.6MB. Max. memory is 16.1GB. [2024-11-06 21:10:11,436 INFO L158 Benchmark]: Witness Printer took 3.81ms. Allocated memory is still 100.7MB. Free memory was 43.5MB in the beginning and 43.5MB in the end (delta: 28.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-06 21:10:11,437 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.17ms. Allocated memory is still 83.9MB. Free memory is still 47.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 228.01ms. Allocated memory is still 100.7MB. Free memory was 76.6MB in the beginning and 65.2MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.92ms. Allocated memory is still 100.7MB. Free memory was 65.2MB in the beginning and 63.9MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 56.56ms. Allocated memory is still 100.7MB. Free memory was 63.9MB in the beginning and 62.3MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 321.49ms. Allocated memory is still 100.7MB. Free memory was 62.3MB in the beginning and 49.7MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1411.64ms. Allocated memory is still 100.7MB. Free memory was 49.0MB in the beginning and 43.5MB in the end (delta: 5.6MB). Peak memory consumption was 4.6MB. Max. memory is 16.1GB. * Witness Printer took 3.81ms. Allocated memory is still 100.7MB. Free memory was 43.5MB in the beginning and 43.5MB in the end (delta: 28.9kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 81]: 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 80, overapproximation of someUnaryFLOAToperation at line 76. Possible FailurePath: [L75] float x = 0.0f; [L76] float y = -0.0f; [L77] CALL, EXPR fmax_float(x, y) [L46] CALL, EXPR __fpclassify_float(x) VAL [\old(x)=0] [L23] __uint32_t w; VAL [\old(x)=0, x=0] [L26] ieee_float_shape_type gf_u; [L27] gf_u.value = (x) [L28] EXPR gf_u.word [L28] (w) = gf_u.word [L31] COND FALSE !(w == 0x00000000 || w == 0x80000000) VAL [\old(x)=0, w=4286578689, x=0] [L33-L34] COND FALSE !((w >= 0x00800000 && w <= 0x7f7fffff) || (w >= 0x80800000 && w <= 0xff7fffff)) VAL [\old(x)=0, w=4286578689, x=0] [L36-L37] COND FALSE !((w >= 0x00000001 && w <= 0x007fffff) || (w >= 0x80000001 && w <= 0x807fffff)) VAL [\old(x)=0, w=4286578689, x=0] [L39] COND FALSE !(w == 0x7f800000 || w == 0xff800000) [L42] return 0; VAL [\old(x)=0, \result=0, x=0] [L46] RET, EXPR __fpclassify_float(x) VAL [x=0, y=4286578698] [L46] COND TRUE __fpclassify_float(x) == 0 [L47] return y; VAL [\result=4286578698, x=0] [L77] RET, EXPR fmax_float(x, y) [L77] float res = fmax_float(x, y); [L80] EXPR res == 0.0f && __signbit_float(res) == 0 VAL [res=4286578698] [L80] EXPR res == 0.0f && __signbit_float(res) == 0 [L80] COND TRUE !(res == 0.0f && __signbit_float(res) == 0) [L81] reach_error() VAL [res=4286578698] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 29 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.3s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5 mSDsluCounter, 541 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 371 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 91 IncrementalHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 170 mSDtfsCounter, 91 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=2, InterpolantAutomatonStates: 23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 12 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 98 NumberOfCodeBlocks, 98 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 75 ConstructedInterpolants, 0 QuantifiedInterpolants, 167 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-06 21:10:11,466 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/float_req_bl_1252b.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c12eaf00463983fc4c27f56efba3b68bea09d23ae311c93edfb6c8bce7a55280 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-06 21:10:13,548 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 21:10:13,640 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-06 21:10:13,646 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 21:10:13,646 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 21:10:13,666 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 21:10:13,666 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 21:10:13,666 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 21:10:13,667 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 21:10:13,667 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 21:10:13,667 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 21:10:13,667 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 21:10:13,667 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 21:10:13,667 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 21:10:13,667 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 21:10:13,667 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 21:10:13,667 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 21:10:13,668 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-06 21:10:13,668 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-06 21:10:13,668 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 21:10:13,668 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 21:10:13,668 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 21:10:13,668 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 21:10:13,668 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-06 21:10:13,668 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-06 21:10:13,668 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 21:10:13,668 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-06 21:10:13,668 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-06 21:10:13,668 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 21:10:13,668 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 21:10:13,669 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 21:10:13,669 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 21:10:13,669 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 21:10:13,669 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 21:10:13,669 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 21:10:13,669 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 21:10:13,669 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 21:10:13,669 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 21:10:13,669 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-06 21:10:13,669 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-06 21:10:13,669 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 21:10:13,670 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 21:10:13,670 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 21:10:13,670 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 21:10:13,670 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 -> c12eaf00463983fc4c27f56efba3b68bea09d23ae311c93edfb6c8bce7a55280 [2024-11-06 21:10:13,963 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 21:10:13,971 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 21:10:13,975 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 21:10:13,977 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 21:10:13,977 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 21:10:13,980 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1252b.c [2024-11-06 21:10:15,250 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 21:10:15,471 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 21:10:15,472 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1252b.c [2024-11-06 21:10:15,481 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6f63d201e/7735800ea736495aa059061820722028/FLAGca1ed9225 [2024-11-06 21:10:15,522 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6f63d201e/7735800ea736495aa059061820722028 [2024-11-06 21:10:15,525 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 21:10:15,526 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-06 21:10:15,527 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 21:10:15,528 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 21:10:15,536 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 21:10:15,537 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:10:15" (1/1) ... [2024-11-06 21:10:15,539 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17a1ed4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:10:15, skipping insertion in model container [2024-11-06 21:10:15,539 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:10:15" (1/1) ... [2024-11-06 21:10:15,554 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 21:10:15,710 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/float-newlib/float_req_bl_1252b.c[1936,1949] [2024-11-06 21:10:15,713 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 21:10:15,727 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 21:10:15,748 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/float-newlib/float_req_bl_1252b.c[1936,1949] [2024-11-06 21:10:15,749 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 21:10:15,767 INFO L204 MainTranslator]: Completed translation [2024-11-06 21:10:15,768 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:10:15 WrapperNode [2024-11-06 21:10:15,769 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 21:10:15,770 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 21:10:15,770 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 21:10:15,770 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 21:10:15,776 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:10:15" (1/1) ... [2024-11-06 21:10:15,790 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:10:15" (1/1) ... [2024-11-06 21:10:15,806 INFO L138 Inliner]: procedures = 21, calls = 19, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 61 [2024-11-06 21:10:15,806 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 21:10:15,807 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 21:10:15,807 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 21:10:15,807 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 21:10:15,812 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:10:15" (1/1) ... [2024-11-06 21:10:15,812 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:10:15" (1/1) ... [2024-11-06 21:10:15,814 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:10:15" (1/1) ... [2024-11-06 21:10:15,821 INFO L175 MemorySlicer]: Split 6 memory accesses to 3 slices as follows [2, 2, 2]. 33 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2024-11-06 21:10:15,821 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:10:15" (1/1) ... [2024-11-06 21:10:15,821 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:10:15" (1/1) ... [2024-11-06 21:10:15,826 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:10:15" (1/1) ... [2024-11-06 21:10:15,828 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:10:15" (1/1) ... [2024-11-06 21:10:15,829 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:10:15" (1/1) ... [2024-11-06 21:10:15,830 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:10:15" (1/1) ... [2024-11-06 21:10:15,832 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 21:10:15,833 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 21:10:15,833 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 21:10:15,833 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 21:10:15,834 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:10:15" (1/1) ... [2024-11-06 21:10:15,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 21:10:15,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 21:10:15,862 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-06 21:10:15,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-06 21:10:15,890 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 21:10:15,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-06 21:10:15,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-06 21:10:15,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-06 21:10:15,890 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-06 21:10:15,890 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_float [2024-11-06 21:10:15,890 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_float [2024-11-06 21:10:15,890 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-06 21:10:15,890 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-06 21:10:15,890 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-06 21:10:15,890 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 21:10:15,890 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 21:10:15,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-06 21:10:15,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-06 21:10:15,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-11-06 21:10:15,891 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-06 21:10:15,970 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 21:10:15,972 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 21:10:16,133 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-11-06 21:10:16,133 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 21:10:16,141 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 21:10:16,141 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-06 21:10:16,142 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:10:16 BoogieIcfgContainer [2024-11-06 21:10:16,142 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 21:10:16,144 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 21:10:16,144 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 21:10:16,150 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 21:10:16,151 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:10:15" (1/3) ... [2024-11-06 21:10:16,152 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48a08f43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:10:16, skipping insertion in model container [2024-11-06 21:10:16,152 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:10:15" (2/3) ... [2024-11-06 21:10:16,152 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48a08f43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:10:16, skipping insertion in model container [2024-11-06 21:10:16,152 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:10:16" (3/3) ... [2024-11-06 21:10:16,154 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_1252b.c [2024-11-06 21:10:16,166 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 21:10:16,166 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 21:10:16,220 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 21:10:16,235 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;@66cca089, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 21:10:16,235 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 21:10:16,241 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 23 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-06 21:10:16,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-06 21:10:16,249 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 21:10:16,250 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 21:10:16,250 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 21:10:16,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 21:10:16,255 INFO L85 PathProgramCache]: Analyzing trace with hash 624090286, now seen corresponding path program 1 times [2024-11-06 21:10:16,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 21:10:16,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [515989451] [2024-11-06 21:10:16,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 21:10:16,268 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 21:10:16,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 21:10:16,272 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 21:10:16,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-06 21:10:16,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 21:10:16,356 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-06 21:10:16,359 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 21:10:16,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 21:10:16,374 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 21:10:16,374 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 21:10:16,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [515989451] [2024-11-06 21:10:16,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [515989451] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 21:10:16,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 21:10:16,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 21:10:16,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498497486] [2024-11-06 21:10:16,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 21:10:16,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-06 21:10:16,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 21:10:16,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-06 21:10:16,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-06 21:10:16,394 INFO L87 Difference]: Start difference. First operand has 27 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 23 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-06 21:10:16,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 21:10:16,404 INFO L93 Difference]: Finished difference Result 51 states and 76 transitions. [2024-11-06 21:10:16,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-06 21:10:16,405 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-11-06 21:10:16,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 21:10:16,409 INFO L225 Difference]: With dead ends: 51 [2024-11-06 21:10:16,409 INFO L226 Difference]: Without dead ends: 24 [2024-11-06 21:10:16,411 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 12 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-06 21:10:16,412 INFO L432 NwaCegarLoop]: 34 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, 34 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-06 21:10:16,413 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 21:10:16,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-11-06 21:10:16,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-11-06 21:10:16,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-06 21:10:16,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2024-11-06 21:10:16,433 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 13 [2024-11-06 21:10:16,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 21:10:16,433 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2024-11-06 21:10:16,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-06 21:10:16,433 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2024-11-06 21:10:16,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-06 21:10:16,434 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 21:10:16,434 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 21:10:16,437 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-06 21:10:16,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 21:10:16,635 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 21:10:16,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 21:10:16,636 INFO L85 PathProgramCache]: Analyzing trace with hash 181002929, now seen corresponding path program 1 times [2024-11-06 21:10:16,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 21:10:16,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1143986949] [2024-11-06 21:10:16,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 21:10:16,636 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 21:10:16,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 21:10:16,639 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 21:10:16,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-06 21:10:16,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 21:10:16,715 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-06 21:10:16,717 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 21:10:16,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 21:10:16,761 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 21:10:16,761 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 21:10:16,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1143986949] [2024-11-06 21:10:16,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1143986949] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 21:10:16,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 21:10:16,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 21:10:16,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807753425] [2024-11-06 21:10:16,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 21:10:16,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 21:10:16,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 21:10:16,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 21:10:16,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 21:10:16,766 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-06 21:10:16,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 21:10:16,794 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2024-11-06 21:10:16,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 21:10:16,795 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-11-06 21:10:16,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 21:10:16,797 INFO L225 Difference]: With dead ends: 36 [2024-11-06 21:10:16,797 INFO L226 Difference]: Without dead ends: 27 [2024-11-06 21:10:16,797 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 21:10:16,798 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 21:10:16,798 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 82 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 21:10:16,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-06 21:10:16,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-06 21:10:16,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-06 21:10:16,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2024-11-06 21:10:16,809 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 14 [2024-11-06 21:10:16,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 21:10:16,809 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2024-11-06 21:10:16,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-06 21:10:16,810 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2024-11-06 21:10:16,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-06 21:10:16,811 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 21:10:16,812 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 21:10:16,816 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-06 21:10:17,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 21:10:17,015 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 21:10:17,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 21:10:17,016 INFO L85 PathProgramCache]: Analyzing trace with hash -943857557, now seen corresponding path program 1 times [2024-11-06 21:10:17,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 21:10:17,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [691144538] [2024-11-06 21:10:17,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 21:10:17,016 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 21:10:17,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 21:10:17,019 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 21:10:17,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-06 21:10:17,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 21:10:17,077 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-06 21:10:17,081 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 21:10:17,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 21:10:17,222 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 21:10:17,223 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 21:10:17,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [691144538] [2024-11-06 21:10:17,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [691144538] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 21:10:17,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 21:10:17,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-06 21:10:17,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642568905] [2024-11-06 21:10:17,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 21:10:17,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 21:10:17,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 21:10:17,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 21:10:17,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-06 21:10:17,225 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-06 21:10:17,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 21:10:17,396 INFO L93 Difference]: Finished difference Result 49 states and 62 transitions. [2024-11-06 21:10:17,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-06 21:10:17,396 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-11-06 21:10:17,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 21:10:17,397 INFO L225 Difference]: With dead ends: 49 [2024-11-06 21:10:17,397 INFO L226 Difference]: Without dead ends: 26 [2024-11-06 21:10:17,398 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-06 21:10:17,398 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 20 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 21:10:17,398 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 73 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 21:10:17,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-06 21:10:17,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-11-06 21:10:17,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-06 21:10:17,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2024-11-06 21:10:17,408 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 15 [2024-11-06 21:10:17,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 21:10:17,408 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2024-11-06 21:10:17,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-06 21:10:17,408 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2024-11-06 21:10:17,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-06 21:10:17,409 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 21:10:17,409 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 21:10:17,413 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-06 21:10:17,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 21:10:17,610 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 21:10:17,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 21:10:17,610 INFO L85 PathProgramCache]: Analyzing trace with hash -941704498, now seen corresponding path program 1 times [2024-11-06 21:10:17,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 21:10:17,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1274244574] [2024-11-06 21:10:17,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 21:10:17,611 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 21:10:17,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 21:10:17,613 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 21:10:17,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-06 21:10:17,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 21:10:17,671 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-06 21:10:17,673 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 21:10:17,690 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-06 21:10:17,690 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 21:10:17,691 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 21:10:17,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1274244574] [2024-11-06 21:10:17,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1274244574] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 21:10:17,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 21:10:17,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 21:10:17,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132456696] [2024-11-06 21:10:17,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 21:10:17,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 21:10:17,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 21:10:17,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 21:10:17,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 21:10:17,692 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-06 21:10:17,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 21:10:17,721 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2024-11-06 21:10:17,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 21:10:17,722 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2024-11-06 21:10:17,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 21:10:17,723 INFO L225 Difference]: With dead ends: 36 [2024-11-06 21:10:17,723 INFO L226 Difference]: Without dead ends: 27 [2024-11-06 21:10:17,723 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 21:10:17,724 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 21:10:17,724 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 21:10:17,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-06 21:10:17,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-06 21:10:17,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-06 21:10:17,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2024-11-06 21:10:17,729 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 22 [2024-11-06 21:10:17,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 21:10:17,729 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2024-11-06 21:10:17,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-06 21:10:17,729 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2024-11-06 21:10:17,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-06 21:10:17,729 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 21:10:17,729 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 21:10:17,735 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-06 21:10:17,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 21:10:17,935 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 21:10:17,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 21:10:17,936 INFO L85 PathProgramCache]: Analyzing trace with hash -939857456, now seen corresponding path program 1 times [2024-11-06 21:10:17,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 21:10:17,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1661142797] [2024-11-06 21:10:17,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 21:10:17,936 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 21:10:17,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 21:10:17,938 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 21:10:17,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-06 21:10:17,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 21:10:17,993 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-06 21:10:17,994 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 21:10:18,057 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-06 21:10:18,057 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 21:10:18,057 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 21:10:18,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1661142797] [2024-11-06 21:10:18,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1661142797] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 21:10:18,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 21:10:18,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-06 21:10:18,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938180224] [2024-11-06 21:10:18,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 21:10:18,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-06 21:10:18,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 21:10:18,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-06 21:10:18,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-06 21:10:18,058 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-06 21:10:18,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 21:10:18,094 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2024-11-06 21:10:18,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-06 21:10:18,096 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2024-11-06 21:10:18,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 21:10:18,096 INFO L225 Difference]: With dead ends: 32 [2024-11-06 21:10:18,096 INFO L226 Difference]: Without dead ends: 29 [2024-11-06 21:10:18,096 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-06 21:10:18,097 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 21:10:18,097 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 95 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 21:10:18,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-06 21:10:18,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-11-06 21:10:18,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-06 21:10:18,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2024-11-06 21:10:18,105 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 22 [2024-11-06 21:10:18,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 21:10:18,105 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2024-11-06 21:10:18,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-06 21:10:18,105 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2024-11-06 21:10:18,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-06 21:10:18,106 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 21:10:18,106 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 21:10:18,109 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-06 21:10:18,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 21:10:18,306 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 21:10:18,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 21:10:18,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1022935030, now seen corresponding path program 1 times [2024-11-06 21:10:18,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 21:10:18,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [352328168] [2024-11-06 21:10:18,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 21:10:18,307 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 21:10:18,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 21:10:18,310 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 21:10:18,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-06 21:10:18,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 21:10:18,368 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-06 21:10:18,371 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 21:10:18,523 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-06 21:10:18,523 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 21:10:18,523 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 21:10:18,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [352328168] [2024-11-06 21:10:18,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [352328168] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 21:10:18,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 21:10:18,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-06 21:10:18,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430449065] [2024-11-06 21:10:18,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 21:10:18,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 21:10:18,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 21:10:18,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 21:10:18,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-06 21:10:18,524 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-06 21:10:18,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 21:10:18,672 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2024-11-06 21:10:18,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-06 21:10:18,673 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2024-11-06 21:10:18,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 21:10:18,673 INFO L225 Difference]: With dead ends: 38 [2024-11-06 21:10:18,674 INFO L226 Difference]: Without dead ends: 21 [2024-11-06 21:10:18,674 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-06 21:10:18,674 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 19 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 21:10:18,675 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 68 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 21:10:18,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-11-06 21:10:18,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-11-06 21:10:18,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 17 states have (on average 1.0) internal successors, (17), 17 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-06 21:10:18,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2024-11-06 21:10:18,680 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 23 [2024-11-06 21:10:18,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 21:10:18,680 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2024-11-06 21:10:18,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-06 21:10:18,680 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2024-11-06 21:10:18,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-06 21:10:18,681 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 21:10:18,681 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 21:10:18,685 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-06 21:10:18,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 21:10:18,881 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 21:10:18,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 21:10:18,882 INFO L85 PathProgramCache]: Analyzing trace with hash 2027753189, now seen corresponding path program 1 times [2024-11-06 21:10:18,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 21:10:18,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [654534533] [2024-11-06 21:10:18,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 21:10:18,882 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 21:10:18,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 21:10:18,884 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 21:10:18,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-06 21:10:18,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-06 21:10:18,963 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-06 21:10:19,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-06 21:10:19,039 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-06 21:10:19,039 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-06 21:10:19,040 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-06 21:10:19,044 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-06 21:10:19,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 21:10:19,244 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-06 21:10:19,263 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-06 21:10:19,266 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 09:10:19 BoogieIcfgContainer [2024-11-06 21:10:19,266 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-06 21:10:19,267 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-06 21:10:19,267 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-06 21:10:19,267 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-06 21:10:19,267 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:10:16" (3/4) ... [2024-11-06 21:10:19,268 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-06 21:10:19,299 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-06 21:10:19,300 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-06 21:10:19,301 INFO L158 Benchmark]: Toolchain (without parser) took 3774.34ms. Allocated memory is still 117.4MB. Free memory was 94.0MB in the beginning and 67.1MB in the end (delta: 26.9MB). Peak memory consumption was 22.2MB. Max. memory is 16.1GB. [2024-11-06 21:10:19,301 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 117.4MB. Free memory is still 85.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-06 21:10:19,301 INFO L158 Benchmark]: CACSL2BoogieTranslator took 241.65ms. Allocated memory is still 117.4MB. Free memory was 93.8MB in the beginning and 81.6MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-06 21:10:19,302 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.60ms. Allocated memory is still 117.4MB. Free memory was 81.6MB in the beginning and 80.4MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-06 21:10:19,302 INFO L158 Benchmark]: Boogie Preprocessor took 25.43ms. Allocated memory is still 117.4MB. Free memory was 80.4MB in the beginning and 78.6MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-06 21:10:19,302 INFO L158 Benchmark]: RCFGBuilder took 308.89ms. Allocated memory is still 117.4MB. Free memory was 78.6MB in the beginning and 65.4MB in the end (delta: 13.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-06 21:10:19,302 INFO L158 Benchmark]: TraceAbstraction took 3121.90ms. Allocated memory is still 117.4MB. Free memory was 64.8MB in the beginning and 69.0MB in the end (delta: -4.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-06 21:10:19,303 INFO L158 Benchmark]: Witness Printer took 33.24ms. Allocated memory is still 117.4MB. Free memory was 69.0MB in the beginning and 67.1MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-06 21:10:19,304 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.30ms. Allocated memory is still 117.4MB. Free memory is still 85.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 241.65ms. Allocated memory is still 117.4MB. Free memory was 93.8MB in the beginning and 81.6MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.60ms. Allocated memory is still 117.4MB. Free memory was 81.6MB in the beginning and 80.4MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 25.43ms. Allocated memory is still 117.4MB. Free memory was 80.4MB in the beginning and 78.6MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 308.89ms. Allocated memory is still 117.4MB. Free memory was 78.6MB in the beginning and 65.4MB in the end (delta: 13.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 3121.90ms. Allocated memory is still 117.4MB. Free memory was 64.8MB in the beginning and 69.0MB in the end (delta: -4.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 33.24ms. Allocated memory is still 117.4MB. Free memory was 69.0MB in the beginning and 67.1MB in the end (delta: 2.0MB). 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 - CounterExampleResult [Line: 81]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L75] float x = 0.0f; [L76] float y = -0.0f; [L77] CALL, EXPR fmax_float(x, y) [L46] CALL, EXPR __fpclassify_float(x) VAL [\old(x)=0.0] [L23] __uint32_t w; VAL [\old(x)=0.0, x=0.0] [L26] ieee_float_shape_type gf_u; [L27] gf_u.value = (x) [L28] EXPR gf_u.word [L28] (w) = gf_u.word [L31] COND TRUE w == 0x00000000 || w == 0x80000000 [L32] return 2; VAL [\old(x)=0.0, \result=2, x=0.0] [L46] RET, EXPR __fpclassify_float(x) VAL [x=0.0, y=0.0] [L46] COND FALSE !(__fpclassify_float(x) == 0) [L50] CALL, EXPR __fpclassify_float(y) VAL [\old(x)=0.0] [L23] __uint32_t w; VAL [\old(x)=0.0, x=0.0] [L26] ieee_float_shape_type gf_u; [L27] gf_u.value = (x) [L28] EXPR gf_u.word [L28] (w) = gf_u.word [L31] COND TRUE w == 0x00000000 || w == 0x80000000 [L32] return 2; VAL [\old(x)=0.0, \result=2, x=0.0] [L50] RET, EXPR __fpclassify_float(y) VAL [x=0.0, y=0.0] [L50] COND FALSE !(__fpclassify_float(y) == 0) [L53] return x > y ? x : y; VAL [\result=0.0] [L77] RET, EXPR fmax_float(x, y) [L77] float res = fmax_float(x, y); [L80] EXPR res == 0.0f && __signbit_float(res) == 0 VAL [res=0.0] [L80] EXPR res == 0.0f && __signbit_float(res) == 0 [L80] CALL, EXPR __signbit_float(res) [L57] __uint32_t w; VAL [x=0.0] [L60] ieee_float_shape_type gf_u; [L61] gf_u.value = (x) [L62] EXPR gf_u.word [L62] (w) = gf_u.word [L65] return (w & 0x80000000) != 0; VAL [\result=1, x=0.0] [L80] RET, EXPR __signbit_float(res) [L80] EXPR res == 0.0f && __signbit_float(res) == 0 [L80] COND TRUE !(res == 0.0f && __signbit_float(res) == 0) [L81] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 27 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.0s, OverallIterations: 7, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 42 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 39 mSDsluCounter, 431 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 277 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 143 IncrementalHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 154 mSDtfsCounter, 143 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 110 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29occurred in iteration=5, InterpolantAutomatonStates: 29, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 135 NumberOfCodeBlocks, 135 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 103 ConstructedInterpolants, 6 QuantifiedInterpolants, 283 SizeOfPredicates, 9 NumberOfNonLiveVariables, 376 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 18/18 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 proved your program to be incorrect! [2024-11-06 21:10:19,331 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 Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE