./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/neural-networks/softmax_9_unsafe.c-amalgamation.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/neural-networks/softmax_9_unsafe.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 c78b855e34bfa3f2fa8c1e78a1f6fd8a30fb8608e2781e3dddaf76f108496aea --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 21:45:17,313 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 21:45:17,379 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 21:45:17,384 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 21:45:17,386 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 21:45:17,406 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 21:45:17,406 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 21:45:17,407 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 21:45:17,407 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 21:45:17,408 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 21:45:17,408 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 21:45:17,408 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 21:45:17,409 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 21:45:17,409 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 21:45:17,410 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 21:45:17,410 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 21:45:17,411 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 21:45:17,413 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 21:45:17,413 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 21:45:17,413 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 21:45:17,414 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 21:45:17,418 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 21:45:17,419 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 21:45:17,419 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 21:45:17,419 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 21:45:17,419 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 21:45:17,420 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 21:45:17,420 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 21:45:17,420 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 21:45:17,420 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 21:45:17,421 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 21:45:17,421 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 21:45:17,421 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 21:45:17,421 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 21:45:17,421 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 21:45:17,422 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 21:45:17,422 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 21:45:17,424 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 21:45:17,424 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 21:45:17,425 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 21:45:17,425 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 21:45:17,426 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 21:45:17,426 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c78b855e34bfa3f2fa8c1e78a1f6fd8a30fb8608e2781e3dddaf76f108496aea [2024-11-09 21:45:17,675 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 21:45:17,700 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 21:45:17,702 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 21:45:17,703 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 21:45:17,704 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 21:45:17,705 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/neural-networks/softmax_9_unsafe.c-amalgamation.i [2024-11-09 21:45:19,162 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 21:45:19,466 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 21:45:19,468 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/neural-networks/softmax_9_unsafe.c-amalgamation.i [2024-11-09 21:45:19,494 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef7e1b01a/0b998888251c49e1aa76bdce43b3adf8/FLAGcd847f8b8 [2024-11-09 21:45:19,511 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef7e1b01a/0b998888251c49e1aa76bdce43b3adf8 [2024-11-09 21:45:19,515 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 21:45:19,517 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 21:45:19,519 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 21:45:19,520 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 21:45:19,525 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 21:45:19,526 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 09:45:19" (1/1) ... [2024-11-09 21:45:19,527 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25f1c45a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:45:19, skipping insertion in model container [2024-11-09 21:45:19,527 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 09:45:19" (1/1) ... [2024-11-09 21:45:19,592 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 21:45:20,088 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:627) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.standardfunctions.StandardFunctionHandler.handleUnaryFloatFunction(StandardFunctionHandler.java:3125) 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:1611) 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:2564) 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:791) 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:2564) 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:2564) 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:1761) 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:1167) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1150) 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:388) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1638) 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:3519) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:2508) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:642) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:135) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.translate(MainTranslator.java:189) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.run(MainTranslator.java:116) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.(MainTranslator.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver.finish(CACSL2BoogieTranslatorObserver.java:145) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-09 21:45:20,094 INFO L158 Benchmark]: Toolchain (without parser) took 576.20ms. Allocated memory is still 180.4MB. Free memory was 105.7MB in the beginning and 88.1MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-09 21:45:20,094 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 117.4MB. Free memory is still 77.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 21:45:20,095 INFO L158 Benchmark]: CACSL2BoogieTranslator took 573.06ms. Allocated memory is still 180.4MB. Free memory was 105.6MB in the beginning and 88.1MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-09 21:45:20,096 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.18ms. Allocated memory is still 117.4MB. Free memory is still 77.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 573.06ms. Allocated memory is still 180.4MB. Free memory was 105.6MB in the beginning and 88.1MB in the end (delta: 17.5MB). 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:627) 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/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/neural-networks/softmax_9_unsafe.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 c78b855e34bfa3f2fa8c1e78a1f6fd8a30fb8608e2781e3dddaf76f108496aea --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 21:45:22,114 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 21:45:22,208 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-09 21:45:22,214 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 21:45:22,215 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 21:45:22,241 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 21:45:22,242 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 21:45:22,243 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 21:45:22,243 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 21:45:22,244 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 21:45:22,245 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 21:45:22,245 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 21:45:22,246 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 21:45:22,246 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 21:45:22,248 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 21:45:22,248 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 21:45:22,248 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 21:45:22,249 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 21:45:22,249 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 21:45:22,249 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 21:45:22,249 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 21:45:22,253 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 21:45:22,253 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 21:45:22,253 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 21:45:22,254 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 21:45:22,254 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 21:45:22,254 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 21:45:22,254 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 21:45:22,255 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 21:45:22,255 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 21:45:22,256 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 21:45:22,256 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 21:45:22,256 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 21:45:22,257 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 21:45:22,257 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 21:45:22,258 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 21:45:22,258 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 21:45:22,258 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 21:45:22,258 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 21:45:22,258 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 21:45:22,259 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 21:45:22,259 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 21:45:22,259 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 21:45:22,259 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 21:45:22,259 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c78b855e34bfa3f2fa8c1e78a1f6fd8a30fb8608e2781e3dddaf76f108496aea [2024-11-09 21:45:22,569 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 21:45:22,592 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 21:45:22,596 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 21:45:22,597 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 21:45:22,597 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 21:45:22,599 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/neural-networks/softmax_9_unsafe.c-amalgamation.i [2024-11-09 21:45:24,177 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 21:45:24,464 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 21:45:24,468 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/neural-networks/softmax_9_unsafe.c-amalgamation.i [2024-11-09 21:45:24,495 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/718db674c/d87e2358680949aa9587adfbf0588903/FLAGd0fa5f06b [2024-11-09 21:45:24,511 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/718db674c/d87e2358680949aa9587adfbf0588903 [2024-11-09 21:45:24,514 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 21:45:24,516 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 21:45:24,517 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 21:45:24,519 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 21:45:24,524 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 21:45:24,525 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 09:45:24" (1/1) ... [2024-11-09 21:45:24,526 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16adc237 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:45:24, skipping insertion in model container [2024-11-09 21:45:24,526 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 09:45:24" (1/1) ... [2024-11-09 21:45:24,579 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 21:45:25,339 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_9_unsafe.c-amalgamation.i[63690,63703] [2024-11-09 21:45:25,347 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 21:45:25,358 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 21:45:25,431 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_9_unsafe.c-amalgamation.i[63690,63703] [2024-11-09 21:45:25,432 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 21:45:25,601 INFO L204 MainTranslator]: Completed translation [2024-11-09 21:45:25,601 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:45:25 WrapperNode [2024-11-09 21:45:25,602 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 21:45:25,603 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 21:45:25,603 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 21:45:25,603 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 21:45:25,609 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:45:25" (1/1) ... [2024-11-09 21:45:25,641 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:45:25" (1/1) ... [2024-11-09 21:45:25,676 INFO L138 Inliner]: procedures = 562, calls = 36, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 126 [2024-11-09 21:45:25,679 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 21:45:25,680 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 21:45:25,680 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 21:45:25,680 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 21:45:25,690 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:45:25" (1/1) ... [2024-11-09 21:45:25,690 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:45:25" (1/1) ... [2024-11-09 21:45:25,696 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:45:25" (1/1) ... [2024-11-09 21:45:25,720 INFO L175 MemorySlicer]: Split 25 memory accesses to 4 slices as follows [2, 7, 12, 4]. 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, 4, 2]. [2024-11-09 21:45:25,723 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:45:25" (1/1) ... [2024-11-09 21:45:25,724 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:45:25" (1/1) ... [2024-11-09 21:45:25,740 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:45:25" (1/1) ... [2024-11-09 21:45:25,741 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:45:25" (1/1) ... [2024-11-09 21:45:25,743 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:45:25" (1/1) ... [2024-11-09 21:45:25,744 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:45:25" (1/1) ... [2024-11-09 21:45:25,748 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 21:45:25,749 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 21:45:25,749 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 21:45:25,749 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 21:45:25,750 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:45:25" (1/1) ... [2024-11-09 21:45:25,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 21:45:25,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 21:45:25,798 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 21:45:25,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 21:45:25,841 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-09 21:45:25,842 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-09 21:45:25,842 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-11-09 21:45:25,842 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-11-09 21:45:25,842 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 21:45:25,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 21:45:25,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-09 21:45:25,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-09 21:45:25,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-09 21:45:25,844 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 21:45:25,844 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 21:45:25,844 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 21:45:25,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-09 21:45:25,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-09 21:45:25,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-11-09 21:45:25,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-11-09 21:45:25,846 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 21:45:25,970 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 21:45:25,973 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 21:45:26,988 INFO L1247 $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; [2024-11-09 21:45:27,001 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-09 21:45:27,001 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 21:45:27,014 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 21:45:27,014 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 21:45:27,015 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 09:45:27 BoogieIcfgContainer [2024-11-09 21:45:27,015 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 21:45:27,017 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 21:45:27,019 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 21:45:27,022 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 21:45:27,022 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 09:45:24" (1/3) ... [2024-11-09 21:45:27,023 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ac0dbca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 09:45:27, skipping insertion in model container [2024-11-09 21:45:27,023 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:45:25" (2/3) ... [2024-11-09 21:45:27,025 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ac0dbca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 09:45:27, skipping insertion in model container [2024-11-09 21:45:27,025 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 09:45:27" (3/3) ... [2024-11-09 21:45:27,026 INFO L112 eAbstractionObserver]: Analyzing ICFG softmax_9_unsafe.c-amalgamation.i [2024-11-09 21:45:27,041 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 21:45:27,041 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 21:45:27,094 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 21:45:27,101 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;@7f1d9a47, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 21:45:27,101 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 21:45:27,105 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 29 states have (on average 1.5172413793103448) internal successors, (44), 30 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 21:45:27,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 21:45:27,112 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 21:45:27,113 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 21:45:27,113 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 21:45:27,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 21:45:27,119 INFO L85 PathProgramCache]: Analyzing trace with hash -555671835, now seen corresponding path program 1 times [2024-11-09 21:45:27,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 21:45:27,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1674531650] [2024-11-09 21:45:27,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 21:45:27,131 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 21:45:27,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 21:45:27,134 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 21:45:27,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-09 21:45:27,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:45:27,290 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 21:45:27,295 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 21:45:27,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 21:45:27,317 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 21:45:27,317 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 21:45:27,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1674531650] [2024-11-09 21:45:27,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1674531650] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 21:45:27,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 21:45:27,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 21:45:27,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298353514] [2024-11-09 21:45:27,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 21:45:27,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 21:45:27,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 21:45:27,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 21:45:27,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 21:45:27,354 INFO L87 Difference]: Start difference. First operand has 31 states, 29 states have (on average 1.5172413793103448) internal successors, (44), 30 states have internal predecessors, (44), 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 9.5) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 21:45:27,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 21:45:27,368 INFO L93 Difference]: Finished difference Result 59 states and 84 transitions. [2024-11-09 21:45:27,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 21:45:27,370 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 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 19 [2024-11-09 21:45:27,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 21:45:27,386 INFO L225 Difference]: With dead ends: 59 [2024-11-09 21:45:27,386 INFO L226 Difference]: Without dead ends: 27 [2024-11-09 21:45:27,391 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 21:45:27,397 INFO L432 NwaCegarLoop]: 35 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, 35 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 21:45:27,399 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 21:45:27,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-09 21:45:27,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-09 21:45:27,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 21:45:27,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2024-11-09 21:45:27,434 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 19 [2024-11-09 21:45:27,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 21:45:27,435 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2024-11-09 21:45:27,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 21:45:27,436 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2024-11-09 21:45:27,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 21:45:27,437 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 21:45:27,438 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 21:45:27,445 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-09 21:45:27,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 21:45:27,639 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 21:45:27,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 21:45:27,641 INFO L85 PathProgramCache]: Analyzing trace with hash 853296476, now seen corresponding path program 1 times [2024-11-09 21:45:27,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 21:45:27,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1094948988] [2024-11-09 21:45:27,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 21:45:27,643 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 21:45:27,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 21:45:27,646 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 21:45:27,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-09 21:45:27,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:45:27,784 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 21:45:27,789 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 21:45:27,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 21:45:27,859 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 21:45:27,859 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 21:45:27,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1094948988] [2024-11-09 21:45:27,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1094948988] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 21:45:27,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 21:45:27,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 21:45:27,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001168101] [2024-11-09 21:45:27,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 21:45:27,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 21:45:27,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 21:45:27,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 21:45:27,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 21:45:27,864 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 21:45:28,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 21:45:28,852 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2024-11-09 21:45:28,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 21:45:28,853 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 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 23 [2024-11-09 21:45:28,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 21:45:28,854 INFO L225 Difference]: With dead ends: 44 [2024-11-09 21:45:28,854 INFO L226 Difference]: Without dead ends: 31 [2024-11-09 21:45:28,855 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 21:45:28,855 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 3 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 21:45:28,856 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 46 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-09 21:45:28,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-09 21:45:28,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2024-11-09 21:45:28,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 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) [2024-11-09 21:45:28,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2024-11-09 21:45:28,861 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 23 [2024-11-09 21:45:28,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 21:45:28,862 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2024-11-09 21:45:28,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 21:45:28,862 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2024-11-09 21:45:28,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-09 21:45:28,863 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 21:45:28,863 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 21:45:28,869 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 (3)] Forceful destruction successful, exit code 0 [2024-11-09 21:45:29,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 21:45:29,064 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 21:45:29,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 21:45:29,065 INFO L85 PathProgramCache]: Analyzing trace with hash 320653790, now seen corresponding path program 1 times [2024-11-09 21:45:29,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 21:45:29,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [475955095] [2024-11-09 21:45:29,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 21:45:29,067 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 21:45:29,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 21:45:29,068 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 21:45:29,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-09 21:45:29,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:45:29,184 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 21:45:29,186 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 21:45:29,310 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 21:45:29,311 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 21:45:29,396 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 21:45:29,397 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 21:45:29,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [475955095] [2024-11-09 21:45:29,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [475955095] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 21:45:29,397 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 21:45:29,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-11-09 21:45:29,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120071916] [2024-11-09 21:45:29,398 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 21:45:29,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 21:45:29,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 21:45:29,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 21:45:29,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-09 21:45:29,401 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 21:45:30,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 21:45:30,347 INFO L93 Difference]: Finished difference Result 50 states and 60 transitions. [2024-11-09 21:45:30,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 21:45:30,354 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 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 27 [2024-11-09 21:45:30,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 21:45:30,355 INFO L225 Difference]: With dead ends: 50 [2024-11-09 21:45:30,355 INFO L226 Difference]: Without dead ends: 37 [2024-11-09 21:45:30,356 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-09 21:45:30,357 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 12 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 21:45:30,357 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 68 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 21:45:30,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-09 21:45:30,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-11-09 21:45:30,363 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) [2024-11-09 21:45:30,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2024-11-09 21:45:30,365 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 27 [2024-11-09 21:45:30,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 21:45:30,366 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2024-11-09 21:45:30,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 21:45:30,366 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2024-11-09 21:45:30,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-09 21:45:30,367 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 21:45:30,367 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 21:45:30,373 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-09 21:45:30,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 21:45:30,568 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 21:45:30,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 21:45:30,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1390419938, now seen corresponding path program 2 times [2024-11-09 21:45:30,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 21:45:30,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [757313502] [2024-11-09 21:45:30,570 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 21:45:30,570 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 21:45:30,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 21:45:30,573 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 21:45:30,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-09 21:45:30,683 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-09 21:45:30,684 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 21:45:30,687 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 21:45:30,691 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 21:45:30,788 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-09 21:45:30,788 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 21:45:30,788 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 21:45:30,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [757313502] [2024-11-09 21:45:30,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [757313502] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 21:45:30,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 21:45:30,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 21:45:30,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051970524] [2024-11-09 21:45:30,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 21:45:30,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 21:45:30,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 21:45:30,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 21:45:30,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 21:45:30,791 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 21:45:31,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 21:45:31,831 INFO L93 Difference]: Finished difference Result 51 states and 60 transitions. [2024-11-09 21:45:31,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 21:45:31,832 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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 35 [2024-11-09 21:45:31,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 21:45:31,833 INFO L225 Difference]: With dead ends: 51 [2024-11-09 21:45:31,833 INFO L226 Difference]: Without dead ends: 42 [2024-11-09 21:45:31,833 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 21:45:31,834 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 11 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 21:45:31,835 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 56 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-09 21:45:31,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-09 21:45:31,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2024-11-09 21:45:31,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.175) internal successors, (47), 40 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 21:45:31,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2024-11-09 21:45:31,846 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 35 [2024-11-09 21:45:31,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 21:45:31,846 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2024-11-09 21:45:31,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 21:45:31,847 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2024-11-09 21:45:31,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-09 21:45:31,848 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 21:45:31,848 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 21:45:31,856 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-09 21:45:32,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 21:45:32,053 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 21:45:32,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 21:45:32,053 INFO L85 PathProgramCache]: Analyzing trace with hash 400226018, now seen corresponding path program 1 times [2024-11-09 21:45:32,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 21:45:32,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [751110673] [2024-11-09 21:45:32,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 21:45:32,054 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 21:45:32,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 21:45:32,058 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 21:45:32,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-09 21:45:32,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:45:32,345 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 21:45:32,347 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 21:45:32,540 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-09 21:45:32,540 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 21:45:32,700 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-09 21:45:32,700 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 21:45:32,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [751110673] [2024-11-09 21:45:32,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [751110673] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 21:45:32,701 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 21:45:32,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-09 21:45:32,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610610523] [2024-11-09 21:45:32,701 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 21:45:32,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 21:45:32,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 21:45:32,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 21:45:32,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-09 21:45:32,704 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 21:45:34,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 21:45:34,807 INFO L93 Difference]: Finished difference Result 67 states and 80 transitions. [2024-11-09 21:45:34,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 21:45:34,808 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 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 40 [2024-11-09 21:45:34,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 21:45:34,809 INFO L225 Difference]: With dead ends: 67 [2024-11-09 21:45:34,809 INFO L226 Difference]: Without dead ends: 56 [2024-11-09 21:45:34,809 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-11-09 21:45:34,810 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 67 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-09 21:45:34,810 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 95 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-09 21:45:34,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-09 21:45:34,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-11-09 21:45:34,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.1272727272727272) internal successors, (62), 55 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 21:45:34,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 62 transitions. [2024-11-09 21:45:34,817 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 62 transitions. Word has length 40 [2024-11-09 21:45:34,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 21:45:34,818 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 62 transitions. [2024-11-09 21:45:34,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 21:45:34,818 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions. [2024-11-09 21:45:34,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-09 21:45:34,819 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 21:45:34,820 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 21:45:34,830 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 (6)] Forceful destruction successful, exit code 0 [2024-11-09 21:45:35,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 21:45:35,021 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 21:45:35,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 21:45:35,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1495264346, now seen corresponding path program 2 times [2024-11-09 21:45:35,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 21:45:35,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1783966223] [2024-11-09 21:45:35,022 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 21:45:35,022 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 21:45:35,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 21:45:35,023 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 21:45:35,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-09 21:45:35,153 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-09 21:45:35,154 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 21:45:35,157 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 21:45:35,159 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 21:45:35,177 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-09 21:45:35,178 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 21:45:35,178 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 21:45:35,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1783966223] [2024-11-09 21:45:35,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1783966223] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 21:45:35,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 21:45:35,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 21:45:35,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951183179] [2024-11-09 21:45:35,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 21:45:35,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 21:45:35,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 21:45:35,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 21:45:35,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 21:45:35,181 INFO L87 Difference]: Start difference. First operand 56 states and 62 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 21:45:35,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 21:45:35,254 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2024-11-09 21:45:35,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 21:45:35,255 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2024-11-09 21:45:35,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 21:45:35,256 INFO L225 Difference]: With dead ends: 61 [2024-11-09 21:45:35,256 INFO L226 Difference]: Without dead ends: 58 [2024-11-09 21:45:35,256 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 21:45:35,257 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 57 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 [2024-11-09 21:45:35,257 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 57 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 21:45:35,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-09 21:45:35,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-11-09 21:45:35,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 57 states have (on average 1.1228070175438596) internal successors, (64), 57 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 21:45:35,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 64 transitions. [2024-11-09 21:45:35,267 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 64 transitions. Word has length 55 [2024-11-09 21:45:35,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 21:45:35,268 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 64 transitions. [2024-11-09 21:45:35,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 21:45:35,268 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 64 transitions. [2024-11-09 21:45:35,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-09 21:45:35,269 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 21:45:35,269 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 21:45:35,274 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 [2024-11-09 21:45:35,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 21:45:35,470 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 21:45:35,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 21:45:35,471 INFO L85 PathProgramCache]: Analyzing trace with hash 1867037477, now seen corresponding path program 1 times [2024-11-09 21:45:35,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 21:45:35,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [99154758] [2024-11-09 21:45:35,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 21:45:35,471 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 21:45:35,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 21:45:35,472 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 21:45:35,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-09 21:45:36,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:45:36,227 INFO L255 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 21:45:36,229 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 21:45:36,268 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-09 21:45:36,269 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 21:45:36,318 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-09 21:45:36,319 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 21:45:36,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [99154758] [2024-11-09 21:45:36,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [99154758] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 21:45:36,319 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 21:45:36,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-11-09 21:45:36,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556994085] [2024-11-09 21:45:36,319 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 21:45:36,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 21:45:36,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 21:45:36,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 21:45:36,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-09 21:45:36,333 INFO L87 Difference]: Start difference. First operand 58 states and 64 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 21:45:36,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 21:45:36,572 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2024-11-09 21:45:36,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 21:45:36,573 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 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 57 [2024-11-09 21:45:36,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 21:45:36,574 INFO L225 Difference]: With dead ends: 67 [2024-11-09 21:45:36,574 INFO L226 Difference]: Without dead ends: 64 [2024-11-09 21:45:36,574 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-11-09 21:45:36,575 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 113 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 [2024-11-09 21:45:36,575 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 113 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 21:45:36,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-09 21:45:36,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-11-09 21:45:36,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.1111111111111112) internal successors, (70), 63 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 21:45:36,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2024-11-09 21:45:36,585 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 57 [2024-11-09 21:45:36,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 21:45:36,586 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2024-11-09 21:45:36,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 21:45:36,586 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2024-11-09 21:45:36,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-09 21:45:36,587 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 21:45:36,587 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 21:45:36,615 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 (8)] Forceful destruction successful, exit code 0 [2024-11-09 21:45:36,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 21:45:36,788 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 21:45:36,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 21:45:36,789 INFO L85 PathProgramCache]: Analyzing trace with hash -1775822046, now seen corresponding path program 2 times [2024-11-09 21:45:36,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 21:45:36,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1718993631] [2024-11-09 21:45:36,789 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 21:45:36,789 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 21:45:36,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 21:45:36,793 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) [2024-11-09 21:45:36,794 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 [2024-11-09 21:45:39,453 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 21:45:39,453 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-09 21:45:39,454 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 21:45:41,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 21:45:41,384 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-09 21:45:41,385 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 21:45:41,385 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 21:45:41,436 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 [2024-11-09 21:45:41,591 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 [2024-11-09 21:45:41,595 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1] [2024-11-09 21:45:41,652 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 21:45:41,656 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 09:45:41 BoogieIcfgContainer [2024-11-09 21:45:41,656 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 21:45:41,657 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 21:45:41,657 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 21:45:41,657 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 21:45:41,657 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 09:45:27" (3/4) ... [2024-11-09 21:45:41,660 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-09 21:45:41,661 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 21:45:41,661 INFO L158 Benchmark]: Toolchain (without parser) took 17146.04ms. Allocated memory was 81.8MB in the beginning and 104.9MB in the end (delta: 23.1MB). Free memory was 56.0MB in the beginning and 48.5MB in the end (delta: 7.5MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-11-09 21:45:41,662 INFO L158 Benchmark]: CDTParser took 0.96ms. Allocated memory is still 56.6MB. Free memory is still 28.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 21:45:41,662 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1084.66ms. Allocated memory is still 81.8MB. Free memory was 55.8MB in the beginning and 36.0MB in the end (delta: 19.8MB). Peak memory consumption was 27.7MB. Max. memory is 16.1GB. [2024-11-09 21:45:41,662 INFO L158 Benchmark]: Boogie Procedure Inliner took 76.26ms. Allocated memory is still 81.8MB. Free memory was 36.0MB in the beginning and 32.6MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 21:45:41,662 INFO L158 Benchmark]: Boogie Preprocessor took 68.58ms. Allocated memory was 81.8MB in the beginning and 104.9MB in the end (delta: 23.1MB). Free memory was 32.6MB in the beginning and 77.2MB in the end (delta: -44.6MB). Peak memory consumption was 4.9MB. Max. memory is 16.1GB. [2024-11-09 21:45:41,663 INFO L158 Benchmark]: IcfgBuilder took 1265.81ms. Allocated memory is still 104.9MB. Free memory was 77.2MB in the beginning and 60.4MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-09 21:45:41,663 INFO L158 Benchmark]: TraceAbstraction took 14639.32ms. Allocated memory is still 104.9MB. Free memory was 59.6MB in the beginning and 48.5MB in the end (delta: 11.0MB). Peak memory consumption was 11.5MB. Max. memory is 16.1GB. [2024-11-09 21:45:41,663 INFO L158 Benchmark]: Witness Printer took 3.98ms. Allocated memory is still 104.9MB. Free memory is still 48.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 21:45:41,665 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.96ms. Allocated memory is still 56.6MB. Free memory is still 28.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1084.66ms. Allocated memory is still 81.8MB. Free memory was 55.8MB in the beginning and 36.0MB in the end (delta: 19.8MB). Peak memory consumption was 27.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 76.26ms. Allocated memory is still 81.8MB. Free memory was 36.0MB in the beginning and 32.6MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 68.58ms. Allocated memory was 81.8MB in the beginning and 104.9MB in the end (delta: 23.1MB). Free memory was 32.6MB in the beginning and 77.2MB in the end (delta: -44.6MB). Peak memory consumption was 4.9MB. Max. memory is 16.1GB. * IcfgBuilder took 1265.81ms. Allocated memory is still 104.9MB. Free memory was 77.2MB in the beginning and 60.4MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 14639.32ms. Allocated memory is still 104.9MB. Free memory was 59.6MB in the beginning and 48.5MB in the end (delta: 11.0MB). Peak memory consumption was 11.5MB. Max. memory is 16.1GB. * Witness Printer took 3.98ms. Allocated memory is still 104.9MB. Free memory is still 48.5MB. 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: 877]: 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. 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={7: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={7:0}, y={3:0}] [L849] ++i VAL [i=2, max=2.0, n=4, x={7: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={7:0}, y={3:0}] [L849] ++i VAL [i=3, max=36893496943512125000, n=4, x={7: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={7:0}, y={3:0}] [L849] ++i VAL [i=4, max=158456325028528680000000000000, n=4, x={7:0}, y={3:0}] [L849] COND FALSE !(i < n) VAL [max=158456325028528680000000000000, n=4, x={7:0}, y={3:0}] [L852] float sum = 0.0f; [L853] i = 0 VAL [i=0, max=158456325028528680000000000000, n=4, sum=0.0, x={7:0}, y={3:0}] [L853] COND TRUE i < n VAL [i=0, max=158456325028528680000000000000, n=4, sum=0.0, x={7:0}, y={3:0}] [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={7:0}, y={3:0}] [L853] COND TRUE i < n VAL [i=1, max=158456325028528680000000000000, n=4, sum=0.0, x={7:0}, y={3:0}] [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={7:0}, y={3:0}] [L853] COND TRUE i < n VAL [i=2, max=158456325028528680000000000000, n=4, sum=0.0, x={7:0}, y={3:0}] [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=2.015625, x={7:0}, y={3:0}] [L853] COND TRUE i < n VAL [i=3, max=158456325028528680000000000000, n=4, sum=2.015625, x={7:0}, y={3:0}] [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=2.015625, x={7:0}, y={3:0}] [L853] COND FALSE !(i < n) VAL [max=158456325028528680000000000000, n=4, sum=2.015625, x={7:0}, y={3:0}] [L858] i = 0 VAL [i=0, max=158456325028528680000000000000, n=4, sum=2.015625, x={7: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=2.015625, x={7: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=2.015625, x={7: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=2.015625, x={7: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=2.015625, x={7:0}, y={3:0}] [L858] COND FALSE !(i < n) VAL [max=158456325028528680000000000000, sum=2.015625, x={7:0}, y={3:0}] [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=0.0, y={3:0}] [L875] COND TRUE i < 4 [L876] EXPR y[i] [L876] sum += y[i] [L875] ++i VAL [i=2, sum=0.0, y={3:0}] [L875] COND TRUE i < 4 [L876] EXPR y[i] [L876] sum += y[i] [L875] ++i VAL [i=3, sum=1.0, y={3:0}] [L875] COND TRUE i < 4 [L876] EXPR y[i] [L876] sum += y[i] [L875] ++i VAL [i=4, sum=0.9999999403953552, y={3:0}] [L875] COND FALSE !(i < 4) VAL [sum=0.9999999403953552, y={3:0}] [L877] COND TRUE !(sum == 1.0f) VAL [y={3:0}] [L877] reach_error() VAL [y={3:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 31 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 14.5s, OverallIterations: 8, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 5.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 93 SdHoareTripleChecker+Valid, 5.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 93 mSDsluCounter, 470 SdHoareTripleChecker+Invalid, 5.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 269 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 141 IncrementalHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 201 mSDtfsCounter, 141 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 373 GetRequests, 352 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=64occurred 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.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 3 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 3.8s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 319 NumberOfCodeBlocks, 275 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 370 ConstructedInterpolants, 0 QuantifiedInterpolants, 610 SizeOfPredicates, 0 NumberOfNonLiveVariables, 736 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 10 InterpolantComputations, 4 PerfectInterpolantSequences, 250/262 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-09 21:45:41,717 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