./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/neural-networks/softmax_6_safe.c-amalgamation.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/neural-networks/softmax_6_safe.c-amalgamation.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 9fd98568ec3860a32f20962bde0f0b21c5bbc578b5380b51bf45be518669bd8c --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 01:38:53,796 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 01:38:53,848 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 01:38:53,851 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 01:38:53,851 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 01:38:53,873 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 01:38:53,874 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 01:38:53,874 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 01:38:53,875 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 01:38:53,875 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 01:38:53,875 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 01:38:53,876 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 01:38:53,876 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 01:38:53,876 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 01:38:53,877 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 01:38:53,877 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 01:38:53,877 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 01:38:53,878 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 01:38:53,878 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 01:38:53,878 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 01:38:53,878 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 01:38:53,881 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 01:38:53,881 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 01:38:53,882 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 01:38:53,882 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 01:38:53,882 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 01:38:53,882 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 01:38:53,882 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 01:38:53,882 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 01:38:53,883 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 01:38:53,883 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 01:38:53,883 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 01:38:53,883 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 01:38:53,883 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 01:38:53,883 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 01:38:53,884 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 01:38:53,884 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 01:38:53,884 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 01:38:53,884 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 01:38:53,884 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 01:38:53,884 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 01:38:53,885 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 01:38:53,886 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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/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 -> 9fd98568ec3860a32f20962bde0f0b21c5bbc578b5380b51bf45be518669bd8c [2024-10-14 01:38:54,089 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 01:38:54,109 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 01:38:54,111 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 01:38:54,112 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 01:38:54,112 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 01:38:54,113 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/neural-networks/softmax_6_safe.c-amalgamation.i [2024-10-14 01:38:55,314 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 01:38:55,534 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 01:38:55,535 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/neural-networks/softmax_6_safe.c-amalgamation.i [2024-10-14 01:38:55,553 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d59e1ead/d1fd0b3b1944442595b68a5b8122cc55/FLAG4e448dec3 [2024-10-14 01:38:55,867 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d59e1ead/d1fd0b3b1944442595b68a5b8122cc55 [2024-10-14 01:38:55,869 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 01:38:55,870 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 01:38:55,870 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 01:38:55,871 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 01:38:55,875 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 01:38:55,875 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 01:38:55" (1/1) ... [2024-10-14 01:38:55,879 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3749cc97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:38:55, skipping insertion in model container [2024-10-14 01:38:55,880 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 01:38:55" (1/1) ... [2024-10-14 01:38:55,929 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 01:38:56,350 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator has thrown an exception: java.lang.UnsupportedOperationException: floating point operation not supported in non-bitprecise translation: isnan at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.expressiontranslation.IntegerTranslation.constructOtherUnaryFloatOperation(IntegerTranslation.java:610) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.standardfunctions.StandardFunctionHandler.handleUnaryFloatFunction(StandardFunctionHandler.java:2735) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.standardfunctions.StandardFunctionHandler.lambda$104(StandardFunctionHandler.java:523) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.standardfunctions.StandardFunctionHandler.translateStandardFunction(StandardFunctionHandler.java:253) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1586) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:271) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:2553) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:307) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:788) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:286) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:2553) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:307) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:2553) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:307) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1736) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:233) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.handleCompoundStatement(CHandler.java:1150) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1133) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:236) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.FunctionHandler.handleFunctionDefinition(FunctionHandler.java:387) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1613) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:159) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.processTUchild(CHandler.java:3471) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:2497) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:639) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:135) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.translate(MainTranslator.java:189) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.run(MainTranslator.java:116) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.(MainTranslator.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver.finish(CACSL2BoogieTranslatorObserver.java:145) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-10-14 01:38:56,355 INFO L158 Benchmark]: Toolchain (without parser) took 484.41ms. Allocated memory was 134.2MB in the beginning and 167.8MB in the end (delta: 33.6MB). Free memory was 77.0MB in the beginning and 136.0MB in the end (delta: -59.0MB). Peak memory consumption was 23.4MB. Max. memory is 16.1GB. [2024-10-14 01:38:56,355 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 134.2MB. Free memory is still 107.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 01:38:56,356 INFO L158 Benchmark]: CACSL2BoogieTranslator took 483.00ms. Allocated memory was 134.2MB in the beginning and 167.8MB in the end (delta: 33.6MB). Free memory was 76.9MB in the beginning and 136.0MB in the end (delta: -59.2MB). Peak memory consumption was 23.4MB. Max. memory is 16.1GB. [2024-10-14 01:38:56,356 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.12ms. Allocated memory is still 134.2MB. Free memory is still 107.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 483.00ms. Allocated memory was 134.2MB in the beginning and 167.8MB in the end (delta: 33.6MB). Free memory was 76.9MB in the beginning and 136.0MB in the end (delta: -59.2MB). Peak memory consumption was 23.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - ExceptionOrErrorResult: UnsupportedOperationException: floating point operation not supported in non-bitprecise translation: isnan de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: UnsupportedOperationException: floating point operation not supported in non-bitprecise translation: isnan: de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.expressiontranslation.IntegerTranslation.constructOtherUnaryFloatOperation(IntegerTranslation.java:610) RESULT: Ultimate could not prove your program: Toolchain returned no result. 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/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/neural-networks/softmax_6_safe.c-amalgamation.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 9fd98568ec3860a32f20962bde0f0b21c5bbc578b5380b51bf45be518669bd8c --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 01:38:57,929 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 01:38:57,990 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-14 01:38:57,996 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 01:38:57,996 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 01:38:58,023 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 01:38:58,024 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 01:38:58,024 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 01:38:58,024 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 01:38:58,025 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 01:38:58,026 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 01:38:58,026 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 01:38:58,027 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 01:38:58,027 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 01:38:58,027 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 01:38:58,030 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 01:38:58,030 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 01:38:58,030 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 01:38:58,030 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 01:38:58,030 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 01:38:58,030 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 01:38:58,031 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 01:38:58,032 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 01:38:58,032 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 01:38:58,032 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 01:38:58,032 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 01:38:58,032 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 01:38:58,032 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 01:38:58,033 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 01:38:58,033 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 01:38:58,033 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 01:38:58,033 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 01:38:58,034 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 01:38:58,035 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 01:38:58,035 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 01:38:58,035 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 01:38:58,035 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 01:38:58,035 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 01:38:58,035 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 01:38:58,035 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 01:38:58,036 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 01:38:58,036 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 01:38:58,037 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 01:38:58,037 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 01:38:58,037 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 01:38:58,037 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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/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 -> 9fd98568ec3860a32f20962bde0f0b21c5bbc578b5380b51bf45be518669bd8c [2024-10-14 01:38:58,284 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 01:38:58,300 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 01:38:58,303 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 01:38:58,304 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 01:38:58,304 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 01:38:58,306 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/neural-networks/softmax_6_safe.c-amalgamation.i [2024-10-14 01:38:59,638 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 01:38:59,875 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 01:38:59,875 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/neural-networks/softmax_6_safe.c-amalgamation.i [2024-10-14 01:38:59,890 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/875a99540/d9b4b712d6474dabb360571eb9b3db50/FLAG078c3a138 [2024-10-14 01:39:00,197 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/875a99540/d9b4b712d6474dabb360571eb9b3db50 [2024-10-14 01:39:00,198 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 01:39:00,199 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 01:39:00,203 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 01:39:00,204 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 01:39:00,207 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 01:39:00,208 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 01:39:00" (1/1) ... [2024-10-14 01:39:00,209 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31e018c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:39:00, skipping insertion in model container [2024-10-14 01:39:00,209 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 01:39:00" (1/1) ... [2024-10-14 01:39:00,257 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 01:39:00,795 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/neural-networks/softmax_6_safe.c-amalgamation.i[63530,63543] [2024-10-14 01:39:00,799 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 01:39:00,810 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 01:39:00,859 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/neural-networks/softmax_6_safe.c-amalgamation.i[63530,63543] [2024-10-14 01:39:00,859 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 01:39:00,948 INFO L204 MainTranslator]: Completed translation [2024-10-14 01:39:00,949 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:39:00 WrapperNode [2024-10-14 01:39:00,949 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 01:39:00,950 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 01:39:00,950 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 01:39:00,950 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 01:39:00,954 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:39:00" (1/1) ... [2024-10-14 01:39:00,979 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:39:00" (1/1) ... [2024-10-14 01:39:00,997 INFO L138 Inliner]: procedures = 562, calls = 32, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 111 [2024-10-14 01:39:00,997 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 01:39:00,998 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 01:39:00,998 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 01:39:00,998 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 01:39:01,005 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:39:00" (1/1) ... [2024-10-14 01:39:01,005 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:39:00" (1/1) ... [2024-10-14 01:39:01,008 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:39:00" (1/1) ... [2024-10-14 01:39:01,017 INFO L175 MemorySlicer]: Split 21 memory accesses to 4 slices as follows [2, 7, 4, 8]. 38 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7, 0, 0]. The 4 writes are split as follows [0, 0, 2, 2]. [2024-10-14 01:39:01,021 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:39:00" (1/1) ... [2024-10-14 01:39:01,021 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:39:00" (1/1) ... [2024-10-14 01:39:01,028 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:39:00" (1/1) ... [2024-10-14 01:39:01,030 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:39:00" (1/1) ... [2024-10-14 01:39:01,032 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:39:00" (1/1) ... [2024-10-14 01:39:01,033 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:39:00" (1/1) ... [2024-10-14 01:39:01,038 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 01:39:01,038 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 01:39:01,039 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 01:39:01,039 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 01:39:01,039 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:39:00" (1/1) ... [2024-10-14 01:39:01,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 01:39:01,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 01:39:01,061 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 01:39:01,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 01:39:01,093 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-10-14 01:39:01,093 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-10-14 01:39:01,093 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-10-14 01:39:01,093 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-10-14 01:39:01,093 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-14 01:39:01,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 01:39:01,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-14 01:39:01,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-14 01:39:01,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-10-14 01:39:01,093 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 01:39:01,093 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 01:39:01,093 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 01:39:01,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-10-14 01:39:01,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-10-14 01:39:01,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-10-14 01:39:01,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-10-14 01:39:01,094 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-14 01:39:01,187 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 01:39:01,197 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 01:39:01,627 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2024-10-14 01:39:01,627 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 01:39:01,656 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 01:39:01,656 INFO L314 CfgBuilder]: Removed 4 assume(true) statements. [2024-10-14 01:39:01,657 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:39:01 BoogieIcfgContainer [2024-10-14 01:39:01,657 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 01:39:01,658 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 01:39:01,658 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 01:39:01,660 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 01:39:01,661 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 01:39:00" (1/3) ... [2024-10-14 01:39:01,661 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73e4b3f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 01:39:01, skipping insertion in model container [2024-10-14 01:39:01,661 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:39:00" (2/3) ... [2024-10-14 01:39:01,661 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73e4b3f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 01:39:01, skipping insertion in model container [2024-10-14 01:39:01,662 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:39:01" (3/3) ... [2024-10-14 01:39:01,666 INFO L112 eAbstractionObserver]: Analyzing ICFG softmax_6_safe.c-amalgamation.i [2024-10-14 01:39:01,678 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 01:39:01,678 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 01:39:01,715 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 01:39:01,719 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;@26f1bdef, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 01:39:01,720 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 01:39:01,722 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 19 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 01:39:01,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-14 01:39:01,726 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:39:01,727 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:39:01,727 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:39:01,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:39:01,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1973270210, now seen corresponding path program 1 times [2024-10-14 01:39:01,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 01:39:01,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [612474832] [2024-10-14 01:39:01,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:39:01,743 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-10-14 01:39:01,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 01:39:01,745 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/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-10-14 01:39:01,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-10-14 01:39:01,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:39:01,865 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-14 01:39:01,868 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 01:39:01,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 01:39:01,883 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 01:39:01,884 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 01:39:01,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [612474832] [2024-10-14 01:39:01,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [612474832] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 01:39:01,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 01:39:01,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 01:39:01,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661467887] [2024-10-14 01:39:01,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 01:39:01,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 01:39:01,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 01:39:01,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 01:39:01,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 01:39:01,918 INFO L87 Difference]: Start difference. First operand has 20 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 19 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 01:39:02,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:39:02,356 INFO L93 Difference]: Finished difference Result 38 states and 59 transitions. [2024-10-14 01:39:02,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 01:39:02,358 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-10-14 01:39:02,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:39:02,363 INFO L225 Difference]: With dead ends: 38 [2024-10-14 01:39:02,363 INFO L226 Difference]: Without dead ends: 18 [2024-10-14 01:39:02,365 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 14 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-10-14 01:39:02,368 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 01:39:02,370 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 01:39:02,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2024-10-14 01:39:02,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2024-10-14 01:39:02,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 01:39:02,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2024-10-14 01:39:02,394 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 15 [2024-10-14 01:39:02,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:39:02,395 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2024-10-14 01:39:02,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 01:39:02,395 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2024-10-14 01:39:02,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-14 01:39:02,396 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:39:02,397 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:39:02,402 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-14 01:39:02,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/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-10-14 01:39:02,602 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:39:02,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:39:02,602 INFO L85 PathProgramCache]: Analyzing trace with hash -564573467, now seen corresponding path program 1 times [2024-10-14 01:39:02,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 01:39:02,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1967068587] [2024-10-14 01:39:02,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:39:02,603 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-10-14 01:39:02,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 01:39:02,606 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/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-10-14 01:39:02,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-10-14 01:39:02,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:39:02,702 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 01:39:02,704 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 01:39:02,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 01:39:02,743 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 01:39:02,743 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 01:39:02,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1967068587] [2024-10-14 01:39:02,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1967068587] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 01:39:02,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 01:39:02,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 01:39:02,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189451613] [2024-10-14 01:39:02,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 01:39:02,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 01:39:02,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 01:39:02,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 01:39:02,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 01:39:02,747 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 01:39:03,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:39:03,639 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2024-10-14 01:39:03,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 01:39:03,642 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-10-14 01:39:03,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:39:03,642 INFO L225 Difference]: With dead ends: 31 [2024-10-14 01:39:03,642 INFO L226 Difference]: Without dead ends: 21 [2024-10-14 01:39:03,643 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 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-10-14 01:39:03,644 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 3 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 23 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.9s IncrementalHoareTripleChecker+Time [2024-10-14 01:39:03,644 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 23 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-14 01:39:03,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-10-14 01:39:03,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2024-10-14 01:39:03,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 01:39:03,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2024-10-14 01:39:03,647 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 15 [2024-10-14 01:39:03,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:39:03,647 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2024-10-14 01:39:03,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 01:39:03,648 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2024-10-14 01:39:03,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-14 01:39:03,648 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:39:03,648 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:39:03,652 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-14 01:39:03,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/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-10-14 01:39:03,849 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:39:03,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:39:03,850 INFO L85 PathProgramCache]: Analyzing trace with hash 951052355, now seen corresponding path program 1 times [2024-10-14 01:39:03,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 01:39:03,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [110415498] [2024-10-14 01:39:03,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:39:03,850 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-10-14 01:39:03,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 01:39:03,868 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/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-10-14 01:39:03,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-10-14 01:39:03,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:39:03,958 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 01:39:03,959 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 01:39:03,995 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 01:39:03,995 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 01:39:03,996 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 01:39:03,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [110415498] [2024-10-14 01:39:03,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [110415498] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 01:39:03,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 01:39:03,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 01:39:03,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115784199] [2024-10-14 01:39:04,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 01:39:04,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 01:39:04,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 01:39:04,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 01:39:04,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 01:39:04,001 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 01:39:04,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:39:04,371 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2024-10-14 01:39:04,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 01:39:04,373 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-10-14 01:39:04,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:39:04,374 INFO L225 Difference]: With dead ends: 29 [2024-10-14 01:39:04,374 INFO L226 Difference]: Without dead ends: 21 [2024-10-14 01:39:04,374 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 01:39:04,375 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 6 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 01:39:04,375 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 29 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 01:39:04,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-10-14 01:39:04,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-10-14 01:39:04,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 01:39:04,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2024-10-14 01:39:04,379 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 18 [2024-10-14 01:39:04,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:39:04,379 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2024-10-14 01:39:04,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 01:39:04,379 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2024-10-14 01:39:04,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-14 01:39:04,380 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:39:04,380 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:39:04,386 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-10-14 01:39:04,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/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-10-14 01:39:04,581 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:39:04,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:39:04,582 INFO L85 PathProgramCache]: Analyzing trace with hash -869397705, now seen corresponding path program 1 times [2024-10-14 01:39:04,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 01:39:04,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1161898591] [2024-10-14 01:39:04,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:39:04,582 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-10-14 01:39:04,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 01:39:04,583 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/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-10-14 01:39:04,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-10-14 01:39:04,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:39:04,813 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 01:39:04,817 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 01:39:04,871 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 01:39:04,872 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 01:39:04,922 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 01:39:04,922 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 01:39:04,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1161898591] [2024-10-14 01:39:04,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1161898591] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 01:39:04,923 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 01:39:04,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-10-14 01:39:04,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233244190] [2024-10-14 01:39:04,923 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 01:39:04,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 01:39:04,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 01:39:04,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 01:39:04,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-10-14 01:39:04,925 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 01:39:06,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:39:06,649 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2024-10-14 01:39:06,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 01:39:06,652 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-10-14 01:39:06,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:39:06,652 INFO L225 Difference]: With dead ends: 34 [2024-10-14 01:39:06,652 INFO L226 Difference]: Without dead ends: 25 [2024-10-14 01:39:06,653 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-14 01:39:06,654 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 23 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-14 01:39:06,654 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 36 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-14 01:39:06,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-10-14 01:39:06,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2024-10-14 01:39:06,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 01:39:06,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2024-10-14 01:39:06,658 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 20 [2024-10-14 01:39:06,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:39:06,658 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2024-10-14 01:39:06,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 01:39:06,658 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2024-10-14 01:39:06,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-14 01:39:06,659 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:39:06,659 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:39:06,668 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-10-14 01:39:06,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/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-10-14 01:39:06,859 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:39:06,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:39:06,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1758208067, now seen corresponding path program 2 times [2024-10-14 01:39:06,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 01:39:06,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1276300980] [2024-10-14 01:39:06,860 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 01:39:06,860 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-10-14 01:39:06,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 01:39:06,861 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/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-10-14 01:39:06,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-10-14 01:39:06,938 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-14 01:39:06,939 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 01:39:06,940 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 01:39:06,941 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 01:39:06,960 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-14 01:39:06,960 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 01:39:06,960 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 01:39:06,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1276300980] [2024-10-14 01:39:06,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1276300980] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 01:39:06,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 01:39:06,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 01:39:06,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234829120] [2024-10-14 01:39:06,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 01:39:06,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 01:39:06,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 01:39:06,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 01:39:06,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 01:39:06,962 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 01:39:08,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:39:08,380 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2024-10-14 01:39:08,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 01:39:08,381 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-10-14 01:39:08,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:39:08,381 INFO L225 Difference]: With dead ends: 28 [2024-10-14 01:39:08,381 INFO L226 Difference]: Without dead ends: 24 [2024-10-14 01:39:08,381 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 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-10-14 01:39:08,382 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 0 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-14 01:39:08,382 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-14 01:39:08,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-10-14 01:39:08,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-10-14 01:39:08,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 01:39:08,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2024-10-14 01:39:08,386 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 22 [2024-10-14 01:39:08,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:39:08,387 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2024-10-14 01:39:08,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 01:39:08,387 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2024-10-14 01:39:08,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-14 01:39:08,387 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:39:08,387 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:39:08,392 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-10-14 01:39:08,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/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-10-14 01:39:08,588 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:39:08,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:39:08,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1306354386, now seen corresponding path program 1 times [2024-10-14 01:39:08,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 01:39:08,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [925823363] [2024-10-14 01:39:08,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:39:08,589 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 01:39:08,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 01:39:08,590 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/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-10-14 01:39:08,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-10-14 01:39:08,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:39:08,989 INFO L255 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 01:39:08,990 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 01:39:09,011 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-14 01:39:09,013 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 01:39:09,046 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-14 01:39:09,048 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 01:39:09,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [925823363] [2024-10-14 01:39:09,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [925823363] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 01:39:09,049 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 01:39:09,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-10-14 01:39:09,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666251547] [2024-10-14 01:39:09,049 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 01:39:09,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 01:39:09,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 01:39:09,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 01:39:09,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-14 01:39:09,050 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 01:39:09,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:39:09,548 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2024-10-14 01:39:09,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 01:39:09,548 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-10-14 01:39:09,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:39:09,549 INFO L225 Difference]: With dead ends: 29 [2024-10-14 01:39:09,549 INFO L226 Difference]: Without dead ends: 25 [2024-10-14 01:39:09,549 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-14 01:39:09,550 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 0 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 01:39:09,550 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 50 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 01:39:09,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-10-14 01:39:09,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-10-14 01:39:09,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 01:39:09,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2024-10-14 01:39:09,557 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 23 [2024-10-14 01:39:09,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:39:09,557 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2024-10-14 01:39:09,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 01:39:09,557 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2024-10-14 01:39:09,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-14 01:39:09,558 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:39:09,558 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:39:09,575 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/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)] Forceful destruction successful, exit code 0 [2024-10-14 01:39:09,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/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-10-14 01:39:09,758 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:39:09,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:39:09,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1818509917, now seen corresponding path program 2 times [2024-10-14 01:39:09,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 01:39:09,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1359228107] [2024-10-14 01:39:09,759 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 01:39:09,759 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-10-14 01:39:09,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 01:39:09,760 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/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-10-14 01:39:09,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-10-14 01:39:10,746 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 01:39:10,746 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2024-10-14 01:39:10,747 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 01:39:11,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 01:39:11,249 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-10-14 01:39:11,249 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 01:39:11,250 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 01:39:11,273 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-10-14 01:39:11,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/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-10-14 01:39:11,457 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1] [2024-10-14 01:39:11,480 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 01:39:11,482 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 01:39:11 BoogieIcfgContainer [2024-10-14 01:39:11,482 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 01:39:11,482 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 01:39:11,482 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 01:39:11,482 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 01:39:11,483 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:39:01" (3/4) ... [2024-10-14 01:39:11,484 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 01:39:11,485 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 01:39:11,485 INFO L158 Benchmark]: Toolchain (without parser) took 11286.04ms. Allocated memory was 77.6MB in the beginning and 94.4MB in the end (delta: 16.8MB). Free memory was 41.9MB in the beginning and 41.3MB in the end (delta: 507.0kB). Peak memory consumption was 17.0MB. Max. memory is 16.1GB. [2024-10-14 01:39:11,485 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 54.5MB. Free memory is still 37.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 01:39:11,486 INFO L158 Benchmark]: CACSL2BoogieTranslator took 745.74ms. Allocated memory is still 77.6MB. Free memory was 41.5MB in the beginning and 39.8MB in the end (delta: 1.6MB). Peak memory consumption was 32.1MB. Max. memory is 16.1GB. [2024-10-14 01:39:11,486 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.70ms. Allocated memory is still 77.6MB. Free memory was 39.8MB in the beginning and 36.5MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 01:39:11,486 INFO L158 Benchmark]: Boogie Preprocessor took 40.02ms. Allocated memory is still 77.6MB. Free memory was 36.5MB in the beginning and 33.6MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 01:39:11,486 INFO L158 Benchmark]: RCFGBuilder took 618.41ms. Allocated memory is still 77.6MB. Free memory was 33.6MB in the beginning and 40.7MB in the end (delta: -7.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-14 01:39:11,487 INFO L158 Benchmark]: TraceAbstraction took 9823.71ms. Allocated memory was 77.6MB in the beginning and 94.4MB in the end (delta: 16.8MB). Free memory was 39.8MB in the beginning and 41.3MB in the end (delta: -1.5MB). Peak memory consumption was 14.2MB. Max. memory is 16.1GB. [2024-10-14 01:39:11,487 INFO L158 Benchmark]: Witness Printer took 2.64ms. Allocated memory is still 94.4MB. Free memory is still 41.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 01:39:11,488 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.15ms. Allocated memory is still 54.5MB. Free memory is still 37.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 745.74ms. Allocated memory is still 77.6MB. Free memory was 41.5MB in the beginning and 39.8MB in the end (delta: 1.6MB). Peak memory consumption was 32.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.70ms. Allocated memory is still 77.6MB. Free memory was 39.8MB in the beginning and 36.5MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.02ms. Allocated memory is still 77.6MB. Free memory was 36.5MB in the beginning and 33.6MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 618.41ms. Allocated memory is still 77.6MB. Free memory was 33.6MB in the beginning and 40.7MB in the end (delta: -7.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 9823.71ms. Allocated memory was 77.6MB in the beginning and 94.4MB in the end (delta: 16.8MB). Free memory was 39.8MB in the beginning and 41.3MB in the end (delta: -1.5MB). Peak memory consumption was 14.2MB. Max. memory is 16.1GB. * Witness Printer took 2.64ms. Allocated memory is still 94.4MB. Free memory is still 41.3MB. 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: 874]: 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 expf at line 854, overapproximation of __builtin_isinf_sign at line 867. Possible FailurePath: [L863] float x[2], y[2]; [L864] x[0] = __VERIFIER_nondet_float() [L865] x[1] = __VERIFIER_nondet_float() [L866] EXPR x[0] [L866] COND FALSE !(!(!__builtin_isnan (x[0]) && !__builtin_isinf_sign (x[0]))) [L867] EXPR x[1] [L867] COND FALSE !(!(!__builtin_isnan (x[1]) && !__builtin_isinf_sign (x[1]))) [L868] CALL softmax(x, y, 2) [L847] int i; [L848] EXPR x[0] [L848] float max = x[0]; [L849] i = 1 VAL [i=1, max=0.0, n=2, x={5:0}, y={3:0}] [L849] COND TRUE i < n [L850] EXPR x[i] [L850] COND TRUE x[i] > max [L851] EXPR x[i] [L851] max = x[i] VAL [i=1, max=2.0, n=2, x={5:0}, y={3:0}] [L849] ++i VAL [i=2, max=2.0, n=2, x={5:0}, y={3:0}] [L849] COND FALSE !(i < n) VAL [max=2.0, n=2, x={5:0}, y={3:0}] [L852] float sum = 0.0f; [L853] i = 0 VAL [i=0, max=2.0, n=2, sum=0.0, x={5:0}, y={3:0}] [L853] COND TRUE i < n [L854] EXPR x[i] [L854] float z = expf(x[i] - max); [L855] sum += z [L856] y[i] = z [L853] ++i VAL [i=1, max=2.0, n=2, sum=0.0, x={5:0}, y={3:0}] [L853] COND TRUE i < n [L854] EXPR x[i] [L854] float z = expf(x[i] - max); [L855] sum += z [L856] y[i] = z [L853] ++i VAL [i=2, max=2.0, n=2, sum=0.0, x={5:0}, y={3:0}] [L853] COND FALSE !(i < n) VAL [max=2.0, n=2, sum=0.0, x={5:0}, y={3:0}] [L858] i = 0 VAL [i=0, max=2.0, n=2, sum=0.0, x={5:0}, y={3:0}] [L858] COND TRUE i < n [L859] EXPR y[i] [L859] y[i] /= sum [L858] ++i VAL [i=1, max=2.0, n=2, sum=0.0, x={5:0}, y={3:0}] [L858] COND TRUE i < n [L859] EXPR y[i] [L859] y[i] /= sum [L858] ++i VAL [i=2, max=2.0, n=2, sum=0.0, x={5:0}, y={3:0}] [L858] COND FALSE !(i < n) VAL [max=2.0, sum=0.0, x={5:0}, y={3:0}] [L868] RET softmax(x, y, 2) [L869] int i; [L870] float sum = 0.0f; [L871] i = 0 VAL [i=0, sum=0.0, y={3:0}] [L871] COND TRUE i < 2 [L872] EXPR y[i] [L872] sum += y[i] [L871] ++i VAL [i=1, sum=NaN, y={3:0}] [L871] COND TRUE i < 2 [L872] EXPR y[i] [L872] sum += y[i] [L871] ++i VAL [i=2, sum=NaN, y={3:0}] [L871] COND FALSE !(i < 2) VAL [sum=NaN, y={3:0}] [L873] float diff = fabsf(sum - 1.0f); VAL [diff=NaN, y={3:0}] [L874] COND TRUE !(__builtin_islessequal(diff, 1e-5f)) VAL [y={3:0}] [L874] reach_error() VAL [y={3:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.8s, OverallIterations: 7, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 5.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 32 SdHoareTripleChecker+Valid, 5.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 32 mSDsluCounter, 191 SdHoareTripleChecker+Invalid, 5.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 95 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 123 IncrementalHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 96 mSDtfsCounter, 123 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 149 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25occurred in iteration=6, InterpolantAutomatonStates: 22, 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, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 137 NumberOfCodeBlocks, 130 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 148 ConstructedInterpolants, 0 QuantifiedInterpolants, 220 SizeOfPredicates, 0 NumberOfNonLiveVariables, 454 ConjunctsInSsa, 19 ConjunctsInUnsatCore, 8 InterpolantComputations, 4 PerfectInterpolantSequences, 26/30 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-10-14 01:39:11,523 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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 Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample