./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/neural-networks/softmax_8_safe.c-amalgamation.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/neural-networks/softmax_8_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 d1df1bd1626d850654993fe892fd690c3c28a022014cb6e98c76da2bd723c8f9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 17:18:58,923 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 17:18:58,977 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 17:18:58,980 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 17:18:58,981 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 17:18:59,005 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 17:18:59,006 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 17:18:59,007 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 17:18:59,007 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 17:18:59,007 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 17:18:59,007 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 17:18:59,008 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 17:18:59,008 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 17:18:59,009 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 17:18:59,009 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 17:18:59,009 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 17:18:59,009 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 17:18:59,009 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 17:18:59,009 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 17:18:59,009 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 17:18:59,009 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 17:18:59,009 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 17:18:59,009 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 17:18:59,009 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 17:18:59,009 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 17:18:59,010 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 17:18:59,010 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 17:18:59,010 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 17:18:59,010 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 17:18:59,010 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 17:18:59,010 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 17:18:59,010 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 17:18:59,010 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 17:18:59,011 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 17:18:59,011 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 17:18:59,011 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 17:18:59,011 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 17:18:59,011 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 17:18:59,011 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 17:18:59,011 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 17:18:59,011 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 17:18:59,011 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 17:18:59,011 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 17:18:59,012 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/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 -> d1df1bd1626d850654993fe892fd690c3c28a022014cb6e98c76da2bd723c8f9 [2025-03-16 17:18:59,218 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 17:18:59,223 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 17:18:59,226 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 17:18:59,227 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 17:18:59,227 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 17:18:59,228 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/neural-networks/softmax_8_safe.c-amalgamation.i [2025-03-16 17:19:00,372 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f06c4e1e/1903b552536744b884662389cdd40549/FLAG3853fb52c [2025-03-16 17:19:00,713 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 17:19:00,714 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/neural-networks/softmax_8_safe.c-amalgamation.i [2025-03-16 17:19:00,731 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f06c4e1e/1903b552536744b884662389cdd40549/FLAG3853fb52c [2025-03-16 17:19:00,745 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f06c4e1e/1903b552536744b884662389cdd40549 [2025-03-16 17:19:00,747 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 17:19:00,749 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 17:19:00,750 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 17:19:00,750 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 17:19:00,753 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 17:19:00,753 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 05:19:00" (1/1) ... [2025-03-16 17:19:00,754 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e978ba6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:19:00, skipping insertion in model container [2025-03-16 17:19:00,755 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 05:19:00" (1/1) ... [2025-03-16 17:19:00,788 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 17:19:01,212 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:629) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.standardfunctions.StandardFunctionHandler.handleUnaryFloatFunction(StandardFunctionHandler.java:3127) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.standardfunctions.StandardFunctionHandler.lambda$150(StandardFunctionHandler.java:621) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.standardfunctions.StandardFunctionHandler.translateStandardFunction(StandardFunctionHandler.java:255) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1658) 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:2628) 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:790) 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:2628) 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:2628) 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:1808) 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:1195) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1178) 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:392) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1685) 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:3589) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:2572) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:649) 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) [2025-03-16 17:19:01,218 INFO L158 Benchmark]: Toolchain (without parser) took 469.24ms. Allocated memory is still 142.6MB. Free memory was 103.2MB in the beginning and 87.5MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 17:19:01,218 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 127.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 17:19:01,221 INFO L158 Benchmark]: CACSL2BoogieTranslator took 467.37ms. Allocated memory is still 142.6MB. Free memory was 103.2MB in the beginning and 87.5MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 17:19:01,222 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.20ms. Allocated memory is still 201.3MB. Free memory is still 127.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 467.37ms. Allocated memory is still 142.6MB. Free memory was 103.2MB in the beginning and 87.5MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. 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:629) 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/21.0.5-tem/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.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/neural-networks/softmax_8_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 d1df1bd1626d850654993fe892fd690c3c28a022014cb6e98c76da2bd723c8f9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 17:19:02,859 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 17:19:02,930 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-16 17:19:02,934 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 17:19:02,935 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 17:19:02,950 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 17:19:02,950 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 17:19:02,950 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 17:19:02,951 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 17:19:02,951 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 17:19:02,951 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 17:19:02,951 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 17:19:02,951 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 17:19:02,951 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 17:19:02,951 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 17:19:02,952 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 17:19:02,952 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 17:19:02,952 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 17:19:02,952 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 17:19:02,952 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 17:19:02,952 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 17:19:02,952 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 17:19:02,952 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 17:19:02,952 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-16 17:19:02,952 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-16 17:19:02,952 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-16 17:19:02,952 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 17:19:02,953 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 17:19:02,953 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 17:19:02,953 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 17:19:02,953 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 17:19:02,953 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 17:19:02,953 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 17:19:02,953 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 17:19:02,953 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 17:19:02,953 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 17:19:02,953 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 17:19:02,954 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 17:19:02,954 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 17:19:02,954 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-16 17:19:02,954 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-16 17:19:02,954 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 17:19:02,954 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 17:19:02,954 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 17:19:02,954 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 17:19:02,954 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/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 -> d1df1bd1626d850654993fe892fd690c3c28a022014cb6e98c76da2bd723c8f9 [2025-03-16 17:19:03,182 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 17:19:03,188 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 17:19:03,191 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 17:19:03,192 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 17:19:03,192 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 17:19:03,193 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/neural-networks/softmax_8_safe.c-amalgamation.i [2025-03-16 17:19:04,358 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/242c92672/61324e1fd7dd4275a1df8cddb4c4a2ff/FLAGc9f6724f1 [2025-03-16 17:19:04,599 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 17:19:04,601 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/neural-networks/softmax_8_safe.c-amalgamation.i [2025-03-16 17:19:04,622 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/242c92672/61324e1fd7dd4275a1df8cddb4c4a2ff/FLAGc9f6724f1 [2025-03-16 17:19:04,642 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/242c92672/61324e1fd7dd4275a1df8cddb4c4a2ff [2025-03-16 17:19:04,644 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 17:19:04,646 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 17:19:04,647 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 17:19:04,647 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 17:19:04,651 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 17:19:04,651 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 05:19:04" (1/1) ... [2025-03-16 17:19:04,653 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26a7b4ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:19:04, skipping insertion in model container [2025-03-16 17:19:04,653 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 05:19:04" (1/1) ... [2025-03-16 17:19:04,690 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 17:19:05,078 WARN L250 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_8_safe.c-amalgamation.i[63746,63759] [2025-03-16 17:19:05,080 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 17:19:05,090 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 17:19:05,144 WARN L250 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_8_safe.c-amalgamation.i[63746,63759] [2025-03-16 17:19:05,145 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 17:19:05,273 INFO L204 MainTranslator]: Completed translation [2025-03-16 17:19:05,273 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:19:05 WrapperNode [2025-03-16 17:19:05,274 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 17:19:05,290 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 17:19:05,290 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 17:19:05,290 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 17:19:05,295 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:19:05" (1/1) ... [2025-03-16 17:19:05,319 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:19:05" (1/1) ... [2025-03-16 17:19:05,339 INFO L138 Inliner]: procedures = 562, calls = 36, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 119 [2025-03-16 17:19:05,342 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 17:19:05,343 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 17:19:05,343 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 17:19:05,343 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 17:19:05,348 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:19:05" (1/1) ... [2025-03-16 17:19:05,348 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:19:05" (1/1) ... [2025-03-16 17:19:05,350 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:19:05" (1/1) ... [2025-03-16 17:19:05,362 INFO L175 MemorySlicer]: Split 25 memory accesses to 4 slices as follows [2, 7, 4, 12]. 48 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7, 0, 0]. The 6 writes are split as follows [0, 0, 2, 4]. [2025-03-16 17:19:05,362 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:19:05" (1/1) ... [2025-03-16 17:19:05,362 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:19:05" (1/1) ... [2025-03-16 17:19:05,368 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:19:05" (1/1) ... [2025-03-16 17:19:05,368 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:19:05" (1/1) ... [2025-03-16 17:19:05,370 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:19:05" (1/1) ... [2025-03-16 17:19:05,370 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:19:05" (1/1) ... [2025-03-16 17:19:05,372 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 17:19:05,373 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 17:19:05,373 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 17:19:05,373 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 17:19:05,373 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:19:05" (1/1) ... [2025-03-16 17:19:05,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 17:19:05,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:19:05,403 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) [2025-03-16 17:19:05,405 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 [2025-03-16 17:19:05,422 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-03-16 17:19:05,422 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-03-16 17:19:05,422 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2025-03-16 17:19:05,422 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2025-03-16 17:19:05,422 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-16 17:19:05,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-16 17:19:05,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-16 17:19:05,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-03-16 17:19:05,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-03-16 17:19:05,422 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 17:19:05,422 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 17:19:05,422 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 17:19:05,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-03-16 17:19:05,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-03-16 17:19:05,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2025-03-16 17:19:05,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2025-03-16 17:19:05,423 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-16 17:19:05,502 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 17:19:05,503 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 17:19:06,448 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L863: call ULTIMATE.dealloc(main_~#x~0#1.base, main_~#x~0#1.offset);havoc main_~#x~0#1.base, main_~#x~0#1.offset;call ULTIMATE.dealloc(main_~#y~0#1.base, main_~#y~0#1.offset);havoc main_~#y~0#1.base, main_~#y~0#1.offset; [2025-03-16 17:19:06,455 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2025-03-16 17:19:06,455 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 17:19:06,461 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 17:19:06,462 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 17:19:06,462 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 05:19:06 BoogieIcfgContainer [2025-03-16 17:19:06,462 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 17:19:06,464 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 17:19:06,464 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 17:19:06,467 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 17:19:06,468 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 05:19:04" (1/3) ... [2025-03-16 17:19:06,468 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38301b8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 05:19:06, skipping insertion in model container [2025-03-16 17:19:06,469 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:19:05" (2/3) ... [2025-03-16 17:19:06,469 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38301b8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 05:19:06, skipping insertion in model container [2025-03-16 17:19:06,469 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 05:19:06" (3/3) ... [2025-03-16 17:19:06,470 INFO L128 eAbstractionObserver]: Analyzing ICFG softmax_8_safe.c-amalgamation.i [2025-03-16 17:19:06,478 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 17:19:06,479 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG softmax_8_safe.c-amalgamation.i that has 1 procedures, 22 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2025-03-16 17:19:06,518 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 17:19:06,525 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;@108a3f2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 17:19:06,525 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 17:19:06,530 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 20 states have (on average 1.55) internal successors, (31), 21 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) [2025-03-16 17:19:06,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-16 17:19:06,533 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:19:06,533 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:19:06,533 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:19:06,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:19:06,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1783447115, now seen corresponding path program 1 times [2025-03-16 17:19:06,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 17:19:06,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [97928686] [2025-03-16 17:19:06,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:19:06,545 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 [2025-03-16 17:19:06,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 17:19:06,547 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) [2025-03-16 17:19:06,548 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 [2025-03-16 17:19:06,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-16 17:19:06,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-16 17:19:06,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:19:06,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:19:06,664 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-16 17:19:06,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:19:06,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:19:06,679 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 17:19:06,680 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 17:19:06,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [97928686] [2025-03-16 17:19:06,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [97928686] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:19:06,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:19:06,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 17:19:06,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640768464] [2025-03-16 17:19:06,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:19:06,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 17:19:06,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 17:19:06,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 17:19:06,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 17:19:06,696 INFO L87 Difference]: Start difference. First operand has 22 states, 20 states have (on average 1.55) internal successors, (31), 21 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) [2025-03-16 17:19:06,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:19:06,704 INFO L93 Difference]: Finished difference Result 42 states and 59 transitions. [2025-03-16 17:19:06,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 17:19:06,705 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 [2025-03-16 17:19:06,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:19:06,709 INFO L225 Difference]: With dead ends: 42 [2025-03-16 17:19:06,709 INFO L226 Difference]: Without dead ends: 18 [2025-03-16 17:19:06,711 INFO L434 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 [2025-03-16 17:19:06,712 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:19:06,713 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:19:06,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2025-03-16 17:19:06,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2025-03-16 17:19:06,728 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) [2025-03-16 17:19:06,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2025-03-16 17:19:06,731 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 15 [2025-03-16 17:19:06,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:19:06,731 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2025-03-16 17:19:06,731 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) [2025-03-16 17:19:06,731 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2025-03-16 17:19:06,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-16 17:19:06,733 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:19:06,733 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:19:06,739 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 (2)] Forceful destruction successful, exit code 0 [2025-03-16 17:19:06,933 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 [2025-03-16 17:19:06,934 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:19:06,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:19:06,935 INFO L85 PathProgramCache]: Analyzing trace with hash -613626191, now seen corresponding path program 1 times [2025-03-16 17:19:06,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 17:19:06,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [764965662] [2025-03-16 17:19:06,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:19:06,935 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 [2025-03-16 17:19:06,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 17:19:06,938 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) [2025-03-16 17:19:06,939 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 [2025-03-16 17:19:06,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-16 17:19:07,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-16 17:19:07,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:19:07,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:19:07,057 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-16 17:19:07,058 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:19:07,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:19:07,116 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 17:19:07,116 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 17:19:07,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [764965662] [2025-03-16 17:19:07,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [764965662] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:19:07,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:19:07,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 17:19:07,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861454940] [2025-03-16 17:19:07,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:19:07,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 17:19:07,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 17:19:07,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 17:19:07,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 17:19:07,119 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) [2025-03-16 17:19:07,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:19:07,971 INFO L93 Difference]: Finished difference Result 27 states and 35 transitions. [2025-03-16 17:19:07,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 17:19:07,985 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 [2025-03-16 17:19:07,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:19:07,986 INFO L225 Difference]: With dead ends: 27 [2025-03-16 17:19:07,986 INFO L226 Difference]: Without dead ends: 21 [2025-03-16 17:19:07,986 INFO L434 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 [2025-03-16 17:19:07,987 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 3 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 17:19:07,987 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 32 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 17:19:07,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2025-03-16 17:19:07,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2025-03-16 17:19:07,989 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) [2025-03-16 17:19:07,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2025-03-16 17:19:07,990 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 15 [2025-03-16 17:19:07,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:19:07,990 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2025-03-16 17:19:07,990 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) [2025-03-16 17:19:07,990 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2025-03-16 17:19:07,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-16 17:19:07,990 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:19:07,990 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:19:07,996 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 [2025-03-16 17:19:08,195 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 [2025-03-16 17:19:08,195 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:19:08,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:19:08,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1095596842, now seen corresponding path program 1 times [2025-03-16 17:19:08,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 17:19:08,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1741309451] [2025-03-16 17:19:08,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:19:08,196 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 [2025-03-16 17:19:08,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 17:19:08,198 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) [2025-03-16 17:19:08,208 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 [2025-03-16 17:19:08,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-16 17:19:08,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-16 17:19:08,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:19:08,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:19:08,316 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-16 17:19:08,317 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:19:08,379 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:19:08,380 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:19:08,423 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:19:08,423 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 17:19:08,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1741309451] [2025-03-16 17:19:08,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1741309451] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 17:19:08,424 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 17:19:08,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2025-03-16 17:19:08,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678499945] [2025-03-16 17:19:08,424 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 17:19:08,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 17:19:08,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 17:19:08,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 17:19:08,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 17:19:08,425 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 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) [2025-03-16 17:19:09,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:19:09,529 INFO L93 Difference]: Finished difference Result 31 states and 41 transitions. [2025-03-16 17:19:09,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 17:19:09,544 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 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) Word has length 18 [2025-03-16 17:19:09,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:19:09,545 INFO L225 Difference]: With dead ends: 31 [2025-03-16 17:19:09,545 INFO L226 Difference]: Without dead ends: 25 [2025-03-16 17:19:09,545 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 17:19:09,545 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 9 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 17:19:09,546 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 47 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 17:19:09,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-03-16 17:19:09,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2025-03-16 17:19:09,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 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) [2025-03-16 17:19:09,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2025-03-16 17:19:09,549 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 31 transitions. Word has length 18 [2025-03-16 17:19:09,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:19:09,549 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 31 transitions. [2025-03-16 17:19:09,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 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) [2025-03-16 17:19:09,549 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2025-03-16 17:19:09,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-16 17:19:09,550 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:19:09,550 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:19:09,555 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 [2025-03-16 17:19:09,750 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 [2025-03-16 17:19:09,750 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:19:09,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:19:09,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1694128394, now seen corresponding path program 2 times [2025-03-16 17:19:09,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 17:19:09,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1707779821] [2025-03-16 17:19:09,751 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 17:19:09,751 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 [2025-03-16 17:19:09,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 17:19:09,753 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) [2025-03-16 17:19:09,755 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 [2025-03-16 17:19:09,795 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-03-16 17:19:09,861 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 15 of 24 statements. [2025-03-16 17:19:09,862 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-16 17:19:09,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:19:09,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-16 17:19:09,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:19:09,949 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 17:19:09,951 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 17:19:09,951 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 17:19:09,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1707779821] [2025-03-16 17:19:09,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1707779821] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:19:09,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:19:09,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 17:19:09,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389062571] [2025-03-16 17:19:09,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:19:09,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 17:19:09,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 17:19:09,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 17:19:09,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 17:19:09,952 INFO L87 Difference]: Start difference. First operand 25 states and 31 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) [2025-03-16 17:19:10,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:19:10,495 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2025-03-16 17:19:10,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 17:19:10,495 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 24 [2025-03-16 17:19:10,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:19:10,496 INFO L225 Difference]: With dead ends: 32 [2025-03-16 17:19:10,496 INFO L226 Difference]: Without dead ends: 27 [2025-03-16 17:19:10,496 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 17:19:10,500 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 5 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 17:19:10,500 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 41 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 17:19:10,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-03-16 17:19:10,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2025-03-16 17:19:10,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 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) [2025-03-16 17:19:10,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2025-03-16 17:19:10,503 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 24 [2025-03-16 17:19:10,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:19:10,503 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2025-03-16 17:19:10,503 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) [2025-03-16 17:19:10,503 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2025-03-16 17:19:10,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-16 17:19:10,504 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:19:10,504 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:19:10,510 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 (5)] Forceful destruction successful, exit code 0 [2025-03-16 17:19:10,704 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 [2025-03-16 17:19:10,705 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:19:10,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:19:10,705 INFO L85 PathProgramCache]: Analyzing trace with hash 682873334, now seen corresponding path program 1 times [2025-03-16 17:19:10,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 17:19:10,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [168441044] [2025-03-16 17:19:10,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:19:10,705 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 [2025-03-16 17:19:10,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 17:19:10,707 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) [2025-03-16 17:19:10,709 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 [2025-03-16 17:19:10,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-16 17:19:10,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-16 17:19:10,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:19:10,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:19:10,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-16 17:19:10,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:19:11,031 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-16 17:19:11,032 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:19:11,099 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-16 17:19:11,099 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 17:19:11,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [168441044] [2025-03-16 17:19:11,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [168441044] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 17:19:11,099 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 17:19:11,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2025-03-16 17:19:11,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953071313] [2025-03-16 17:19:11,099 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 17:19:11,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 17:19:11,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 17:19:11,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 17:19:11,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-16 17:19:11,100 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 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) [2025-03-16 17:19:13,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:19:13,418 INFO L93 Difference]: Finished difference Result 39 states and 52 transitions. [2025-03-16 17:19:13,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 17:19:13,418 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 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) Word has length 26 [2025-03-16 17:19:13,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:19:13,419 INFO L225 Difference]: With dead ends: 39 [2025-03-16 17:19:13,419 INFO L226 Difference]: Without dead ends: 33 [2025-03-16 17:19:13,419 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-03-16 17:19:13,419 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 31 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-16 17:19:13,419 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 65 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-16 17:19:13,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-03-16 17:19:13,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2025-03-16 17:19:13,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.21875) internal successors, (39), 32 states have internal predecessors, (39), 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) [2025-03-16 17:19:13,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2025-03-16 17:19:13,423 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 26 [2025-03-16 17:19:13,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:19:13,423 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2025-03-16 17:19:13,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 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) [2025-03-16 17:19:13,424 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2025-03-16 17:19:13,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-16 17:19:13,424 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:19:13,424 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:19:13,434 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 [2025-03-16 17:19:13,625 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 [2025-03-16 17:19:13,625 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:19:13,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:19:13,625 INFO L85 PathProgramCache]: Analyzing trace with hash 430529398, now seen corresponding path program 2 times [2025-03-16 17:19:13,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 17:19:13,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1311537905] [2025-03-16 17:19:13,626 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 17:19:13,626 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 [2025-03-16 17:19:13,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 17:19:13,628 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) [2025-03-16 17:19:13,629 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 [2025-03-16 17:19:13,672 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-03-16 17:19:13,729 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 15 of 32 statements. [2025-03-16 17:19:13,729 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-16 17:19:13,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:19:13,732 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 17:19:13,733 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:19:13,740 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-16 17:19:13,740 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 17:19:13,740 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 17:19:13,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1311537905] [2025-03-16 17:19:13,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1311537905] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:19:13,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:19:13,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 17:19:13,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864442613] [2025-03-16 17:19:13,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:19:13,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 17:19:13,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 17:19:13,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 17:19:13,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 17:19:13,741 INFO L87 Difference]: Start difference. First operand 33 states and 39 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) [2025-03-16 17:19:13,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:19:13,851 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2025-03-16 17:19:13,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 17:19:13,854 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 32 [2025-03-16 17:19:13,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:19:13,855 INFO L225 Difference]: With dead ends: 37 [2025-03-16 17:19:13,855 INFO L226 Difference]: Without dead ends: 34 [2025-03-16 17:19:13,855 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 17:19:13,855 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 17:19:13,856 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 39 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 17:19:13,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-03-16 17:19:13,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2025-03-16 17:19:13,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 33 states have internal predecessors, (40), 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) [2025-03-16 17:19:13,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2025-03-16 17:19:13,862 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 32 [2025-03-16 17:19:13,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:19:13,863 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2025-03-16 17:19:13,863 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) [2025-03-16 17:19:13,863 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2025-03-16 17:19:13,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-16 17:19:13,864 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:19:13,864 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:19:13,869 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 (7)] Ended with exit code 0 [2025-03-16 17:19:14,064 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 [2025-03-16 17:19:14,065 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:19:14,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:19:14,065 INFO L85 PathProgramCache]: Analyzing trace with hash 461541199, now seen corresponding path program 1 times [2025-03-16 17:19:14,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 17:19:14,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [765973561] [2025-03-16 17:19:14,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:19:14,066 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 [2025-03-16 17:19:14,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 17:19:14,067 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) [2025-03-16 17:19:14,068 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 [2025-03-16 17:19:14,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-16 17:19:14,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-16 17:19:14,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:19:14,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:19:14,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 17:19:14,756 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:19:14,769 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-16 17:19:14,769 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:19:14,800 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-16 17:19:14,800 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 17:19:14,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [765973561] [2025-03-16 17:19:14,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [765973561] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 17:19:14,800 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 17:19:14,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2025-03-16 17:19:14,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96254115] [2025-03-16 17:19:14,800 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 17:19:14,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 17:19:14,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 17:19:14,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 17:19:14,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 17:19:14,801 INFO L87 Difference]: Start difference. First operand 34 states and 40 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) [2025-03-16 17:19:15,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:19:15,048 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2025-03-16 17:19:15,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 17:19:15,053 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 33 [2025-03-16 17:19:15,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:19:15,053 INFO L225 Difference]: With dead ends: 40 [2025-03-16 17:19:15,053 INFO L226 Difference]: Without dead ends: 37 [2025-03-16 17:19:15,053 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-03-16 17:19:15,054 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 17:19:15,054 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 75 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 17:19:15,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-03-16 17:19:15,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2025-03-16 17:19:15,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 36 states have internal predecessors, (43), 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) [2025-03-16 17:19:15,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2025-03-16 17:19:15,060 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 33 [2025-03-16 17:19:15,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:19:15,060 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2025-03-16 17:19:15,060 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) [2025-03-16 17:19:15,061 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2025-03-16 17:19:15,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-16 17:19:15,061 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:19:15,061 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:19:15,083 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 [2025-03-16 17:19:15,262 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 [2025-03-16 17:19:15,262 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:19:15,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:19:15,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1615071670, now seen corresponding path program 2 times [2025-03-16 17:19:15,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 17:19:15,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [285954681] [2025-03-16 17:19:15,263 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 17:19:15,263 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 [2025-03-16 17:19:15,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 17:19:15,265 INFO L229 MonitoredProcess]: Starting monitored process 9 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) [2025-03-16 17:19:15,267 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 (9)] Waiting until timeout for monitored process [2025-03-16 17:19:15,322 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-03-16 17:19:17,730 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-03-16 17:19:17,730 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 17:19:17,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 17:19:17,730 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-16 17:19:17,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-16 17:19:18,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-16 17:19:18,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:19:18,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 17:19:18,972 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-03-16 17:19:18,972 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-16 17:19:18,973 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 17:19:19,019 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 (9)] Ended with exit code 0 [2025-03-16 17:19:19,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /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 [2025-03-16 17:19:19,178 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1] [2025-03-16 17:19:19,213 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 17:19:19,215 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 05:19:19 BoogieIcfgContainer [2025-03-16 17:19:19,215 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 17:19:19,215 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 17:19:19,215 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 17:19:19,215 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 17:19:19,216 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 05:19:06" (3/4) ... [2025-03-16 17:19:19,217 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-16 17:19:19,218 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 17:19:19,218 INFO L158 Benchmark]: Toolchain (without parser) took 14573.14ms. Allocated memory is still 83.9MB. Free memory was 57.2MB in the beginning and 34.4MB in the end (delta: 22.8MB). Peak memory consumption was 27.8MB. Max. memory is 16.1GB. [2025-03-16 17:19:19,219 INFO L158 Benchmark]: CDTParser took 1.43ms. Allocated memory is still 83.9MB. Free memory was 62.3MB in the beginning and 62.2MB in the end (delta: 33.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 17:19:19,219 INFO L158 Benchmark]: CACSL2BoogieTranslator took 642.60ms. Allocated memory is still 83.9MB. Free memory was 56.9MB in the beginning and 54.3MB in the end (delta: 2.6MB). Peak memory consumption was 57.1MB. Max. memory is 16.1GB. [2025-03-16 17:19:19,219 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.95ms. Allocated memory is still 83.9MB. Free memory was 54.3MB in the beginning and 51.5MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 17:19:19,219 INFO L158 Benchmark]: Boogie Preprocessor took 29.59ms. Allocated memory is still 83.9MB. Free memory was 51.5MB in the beginning and 49.6MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 17:19:19,219 INFO L158 Benchmark]: IcfgBuilder took 1089.45ms. Allocated memory is still 83.9MB. Free memory was 49.6MB in the beginning and 34.1MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 17:19:19,219 INFO L158 Benchmark]: TraceAbstraction took 12751.11ms. Allocated memory is still 83.9MB. Free memory was 33.3MB in the beginning and 35.0MB in the end (delta: -1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 17:19:19,219 INFO L158 Benchmark]: Witness Printer took 2.72ms. Allocated memory is still 83.9MB. Free memory was 34.4MB in the beginning and 34.4MB in the end (delta: 3.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 17:19:19,220 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.43ms. Allocated memory is still 83.9MB. Free memory was 62.3MB in the beginning and 62.2MB in the end (delta: 33.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 642.60ms. Allocated memory is still 83.9MB. Free memory was 56.9MB in the beginning and 54.3MB in the end (delta: 2.6MB). Peak memory consumption was 57.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.95ms. Allocated memory is still 83.9MB. Free memory was 54.3MB in the beginning and 51.5MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 29.59ms. Allocated memory is still 83.9MB. Free memory was 51.5MB in the beginning and 49.6MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 1089.45ms. Allocated memory is still 83.9MB. Free memory was 49.6MB in the beginning and 34.1MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 12751.11ms. Allocated memory is still 83.9MB. Free memory was 33.3MB in the beginning and 35.0MB in the end (delta: -1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.72ms. Allocated memory is still 83.9MB. Free memory was 34.4MB in the beginning and 34.4MB in the end (delta: 3.7kB). 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: 878]: 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 871, overapproximation of __builtin_isinf_sign at line 869, overapproximation of __builtin_isinf_sign at line 870, overapproximation of __builtin_isinf_sign at line 868. Possible FailurePath: [L863] float x[4], y[4]; [L864] x[0] = __VERIFIER_nondet_float() [L865] x[1] = __VERIFIER_nondet_float() [L866] x[2] = __VERIFIER_nondet_float() [L867] x[3] = __VERIFIER_nondet_float() [L868] EXPR x[0] [L868] COND FALSE !(!(!__builtin_isnan (x[0]) && !__builtin_isinf_sign (x[0]))) [L869] EXPR x[1] [L869] COND FALSE !(!(!__builtin_isnan (x[1]) && !__builtin_isinf_sign (x[1]))) [L870] EXPR x[2] [L870] COND FALSE !(!(!__builtin_isnan (x[2]) && !__builtin_isinf_sign (x[2]))) [L871] EXPR x[3] [L871] COND FALSE !(!(!__builtin_isnan (x[3]) && !__builtin_isinf_sign (x[3]))) [L872] CALL softmax(x, y, 4) [L847] int i; [L848] EXPR x[0] [L848] float max = x[0]; [L849] i = 1 VAL [i=1, max=0.0, n=4, x={-2147483648: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=4, x={-2147483648:0}, y={3:0}] [L849] ++i VAL [i=2, max=2.0, n=4, x={-2147483648: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=2, max=36893496943512125000, n=4, x={-2147483648:0}, y={3:0}] [L849] ++i VAL [i=3, max=36893496943512125000, n=4, x={-2147483648: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=3, max=158456325028528680000000000000, n=4, x={-2147483648:0}, y={3:0}] [L849] ++i VAL [i=4, max=158456325028528680000000000000, n=4, x={-2147483648:0}, y={3:0}] [L849] COND FALSE !(i < n) [L852] float sum = 0.0f; [L853] i = 0 VAL [i=0, max=158456325028528680000000000000, n=4, sum=0.0, x={-2147483648: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=158456325028528680000000000000, n=4, sum=0.0, x={-2147483648: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=158456325028528680000000000000, n=4, sum=0.0, x={-2147483648: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=3, max=158456325028528680000000000000, n=4, sum=0.0, x={-2147483648: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=4, max=158456325028528680000000000000, n=4, sum=0.0, x={-2147483648:0}, y={3:0}] [L853] COND FALSE !(i < n) [L858] i = 0 VAL [i=0, max=158456325028528680000000000000, n=4, sum=0.0, x={-2147483648:0}, y={3:0}] [L858] COND TRUE i < n [L859] EXPR y[i] [L859] y[i] /= sum [L858] ++i VAL [i=1, max=158456325028528680000000000000, n=4, sum=0.0, x={-2147483648:0}, y={3:0}] [L858] COND TRUE i < n [L859] EXPR y[i] [L859] y[i] /= sum [L858] ++i VAL [i=2, max=158456325028528680000000000000, n=4, sum=0.0, x={-2147483648:0}, y={3:0}] [L858] COND TRUE i < n [L859] EXPR y[i] [L859] y[i] /= sum [L858] ++i VAL [i=3, max=158456325028528680000000000000, n=4, sum=0.0, x={-2147483648:0}, y={3:0}] [L858] COND TRUE i < n [L859] EXPR y[i] [L859] y[i] /= sum [L858] ++i VAL [i=4, max=158456325028528680000000000000, n=4, sum=0.0, x={-2147483648:0}, y={3:0}] [L858] COND FALSE !(i < n) [L872] RET softmax(x, y, 4) [L873] int i; [L874] float sum = 0.0f; [L875] i = 0 VAL [i=0, sum=0.0, y={3:0}] [L875] COND TRUE i < 4 [L876] EXPR y[i] [L876] sum += y[i] [L875] ++i VAL [i=1, sum=NaN, y={3:0}] [L875] COND TRUE i < 4 [L876] EXPR y[i] [L876] sum += y[i] [L875] ++i VAL [i=2, sum=NaN, y={3:0}] [L875] COND TRUE i < 4 [L876] EXPR y[i] [L876] sum += y[i] [L875] ++i VAL [i=3, sum=NaN, y={3:0}] [L875] COND TRUE i < 4 [L876] EXPR y[i] [L876] sum += y[i] [L875] ++i VAL [i=4, sum=NaN, y={3:0}] [L875] COND FALSE !(i < 4) [L877] float diff = fabsf(sum - 1.0f); VAL [diff=NaN, y={3:0}] [L878] COND TRUE !(__builtin_islessequal(diff, 1e-5f)) VAL [y={3:0}] [L878] reach_error() VAL [y={3:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 22 locations, 31 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.7s, OverallIterations: 8, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 5.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 48 SdHoareTripleChecker+Valid, 5.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 48 mSDsluCounter, 325 SdHoareTripleChecker+Invalid, 4.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 188 mSDsCounter, 24 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 106 IncrementalHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 24 mSolverCounterUnsat, 137 mSDtfsCounter, 106 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 233 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37occurred in iteration=7, InterpolantAutomatonStates: 30, 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, 7 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 3.5s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 199 NumberOfCodeBlocks, 173 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 230 ConstructedInterpolants, 0 QuantifiedInterpolants, 370 SizeOfPredicates, 0 NumberOfNonLiveVariables, 700 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 10 InterpolantComputations, 4 PerfectInterpolantSequences, 134/140 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, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-16 17:19:19,246 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