./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/knuth_valuebound10.i --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5189fb62 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/knuth_valuebound10.i -s /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/certificate-witnesses-artifact/automizer --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 d57b5e0932e2ae1d13ff96f4ee516144e471d697de2e183c71b602b9615c31f3 --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-5189fb6-m [2024-09-13 02:25:36,247 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-13 02:25:36,321 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-13 02:25:36,327 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-13 02:25:36,327 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-13 02:25:36,357 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-13 02:25:36,358 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-13 02:25:36,358 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-13 02:25:36,359 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-13 02:25:36,360 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-13 02:25:36,360 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-13 02:25:36,361 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-13 02:25:36,361 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-13 02:25:36,361 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-13 02:25:36,362 INFO L153 SettingsManager]: * Use SBE=true [2024-09-13 02:25:36,362 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-13 02:25:36,362 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-13 02:25:36,363 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-13 02:25:36,363 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-13 02:25:36,365 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-13 02:25:36,366 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-13 02:25:36,369 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-13 02:25:36,370 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-13 02:25:36,370 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-13 02:25:36,370 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-13 02:25:36,370 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-13 02:25:36,370 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-13 02:25:36,371 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-13 02:25:36,371 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-13 02:25:36,371 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-13 02:25:36,371 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-13 02:25:36,371 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-13 02:25:36,372 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-13 02:25:36,372 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-13 02:25:36,373 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-13 02:25:36,373 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-13 02:25:36,373 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-13 02:25:36,373 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-13 02:25:36,374 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-13 02:25:36,374 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-13 02:25:36,374 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-13 02:25:36,377 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-13 02:25:36,377 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/certificate-witnesses-artifact/automizer/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/certificate-witnesses-artifact/automizer 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 -> d57b5e0932e2ae1d13ff96f4ee516144e471d697de2e183c71b602b9615c31f3 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 [2024-09-13 02:25:36,609 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-13 02:25:36,638 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-13 02:25:36,641 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-13 02:25:36,642 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-13 02:25:36,643 INFO L274 PluginConnector]: CDTParser initialized [2024-09-13 02:25:36,644 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/knuth_valuebound10.i [2024-09-13 02:25:38,065 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-13 02:25:38,234 INFO L384 CDTParser]: Found 1 translation units. [2024-09-13 02:25:38,235 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/knuth_valuebound10.i [2024-09-13 02:25:38,242 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/d23ded699/8fba444b4a464001a8626b76c25a47fc/FLAGc1b30e6ae [2024-09-13 02:25:38,255 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/d23ded699/8fba444b4a464001a8626b76c25a47fc [2024-09-13 02:25:38,257 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-13 02:25:38,259 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-13 02:25:38,260 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-13 02:25:38,261 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-13 02:25:38,266 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-13 02:25:38,267 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 02:25:38" (1/1) ... [2024-09-13 02:25:38,267 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b31233f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:25:38, skipping insertion in model container [2024-09-13 02:25:38,268 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 02:25:38" (1/1) ... [2024-09-13 02:25:38,288 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-13 02:25:38,477 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/knuth_valuebound10.i[948,961] [2024-09-13 02:25:38,494 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: sqrt at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.expressiontranslation.IntegerTranslation.constructOtherUnaryFloatOperation(IntegerTranslation.java:610) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.standardfunctions.StandardFunctionHandler.handleUnaryFloatFunction(StandardFunctionHandler.java:2721) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.standardfunctions.StandardFunctionHandler.translateStandardFunction(StandardFunctionHandler.java:252) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1586) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:271) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:789) 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:1494) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:224) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.handleCompoundStatement(CHandler.java:1150) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1133) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:236) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.FunctionHandler.handleFunctionDefinition(FunctionHandler.java:387) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1613) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:159) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.processTUchild(CHandler.java:3471) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:2497) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:639) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:135) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.translate(MainTranslator.java:189) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.run(MainTranslator.java:116) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.(MainTranslator.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver.finish(CACSL2BoogieTranslatorObserver.java:145) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-09-13 02:25:38,502 INFO L158 Benchmark]: Toolchain (without parser) took 240.85ms. Allocated memory is still 155.2MB. Free memory was 85.0MB in the beginning and 75.1MB in the end (delta: 9.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-09-13 02:25:38,504 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 155.2MB. Free memory is still 105.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-13 02:25:38,504 INFO L158 Benchmark]: CACSL2BoogieTranslator took 238.19ms. Allocated memory is still 155.2MB. Free memory was 84.8MB in the beginning and 75.1MB in the end (delta: 9.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-09-13 02:25:38,506 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.19ms. Allocated memory is still 155.2MB. Free memory is still 105.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 238.19ms. Allocated memory is still 155.2MB. Free memory was 84.8MB in the beginning and 75.1MB in the end (delta: 9.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - ExceptionOrErrorResult: UnsupportedOperationException: floating point operation not supported in non-bitprecise translation: sqrt de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: UnsupportedOperationException: floating point operation not supported in non-bitprecise translation: sqrt: de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.expressiontranslation.IntegerTranslation.constructOtherUnaryFloatOperation(IntegerTranslation.java:610) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/knuth_valuebound10.i -s /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/certificate-witnesses-artifact/automizer --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 d57b5e0932e2ae1d13ff96f4ee516144e471d697de2e183c71b602b9615c31f3 --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-5189fb6-m [2024-09-13 02:25:40,463 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-13 02:25:40,547 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-09-13 02:25:40,553 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-13 02:25:40,554 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-13 02:25:40,576 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-13 02:25:40,577 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-13 02:25:40,577 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-13 02:25:40,578 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-13 02:25:40,578 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-13 02:25:40,579 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-13 02:25:40,579 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-13 02:25:40,580 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-13 02:25:40,580 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-13 02:25:40,580 INFO L153 SettingsManager]: * Use SBE=true [2024-09-13 02:25:40,581 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-13 02:25:40,581 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-13 02:25:40,581 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-13 02:25:40,582 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-13 02:25:40,582 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-13 02:25:40,582 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-13 02:25:40,583 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-13 02:25:40,583 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-13 02:25:40,587 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-09-13 02:25:40,587 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-09-13 02:25:40,588 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-13 02:25:40,588 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-09-13 02:25:40,588 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-13 02:25:40,588 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-13 02:25:40,589 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-13 02:25:40,589 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-13 02:25:40,589 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-13 02:25:40,589 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-13 02:25:40,589 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-13 02:25:40,590 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-13 02:25:40,590 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-13 02:25:40,594 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-13 02:25:40,594 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-13 02:25:40,595 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-09-13 02:25:40,595 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-09-13 02:25:40,595 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-13 02:25:40,595 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-13 02:25:40,596 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-13 02:25:40,596 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-13 02:25:40,596 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-09-13 02:25:40,596 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/certificate-witnesses-artifact/automizer/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/certificate-witnesses-artifact/automizer 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 -> d57b5e0932e2ae1d13ff96f4ee516144e471d697de2e183c71b602b9615c31f3 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 [2024-09-13 02:25:40,922 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-13 02:25:40,943 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-13 02:25:40,946 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-13 02:25:40,948 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-13 02:25:40,950 INFO L274 PluginConnector]: CDTParser initialized [2024-09-13 02:25:40,951 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/knuth_valuebound10.i [2024-09-13 02:25:42,507 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-13 02:25:42,701 INFO L384 CDTParser]: Found 1 translation units. [2024-09-13 02:25:42,702 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/knuth_valuebound10.i [2024-09-13 02:25:42,710 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/a950986c8/406c137259e043d092053f17d8641c06/FLAG0d066a705 [2024-09-13 02:25:42,722 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/a950986c8/406c137259e043d092053f17d8641c06 [2024-09-13 02:25:42,725 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-13 02:25:42,726 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-13 02:25:42,727 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-13 02:25:42,727 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-13 02:25:42,736 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-13 02:25:42,737 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 02:25:42" (1/1) ... [2024-09-13 02:25:42,737 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fd3e86c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:25:42, skipping insertion in model container [2024-09-13 02:25:42,738 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 02:25:42" (1/1) ... [2024-09-13 02:25:42,757 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-13 02:25:42,936 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/knuth_valuebound10.i[948,961] [2024-09-13 02:25:42,984 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-13 02:25:43,001 INFO L200 MainTranslator]: Completed pre-run [2024-09-13 02:25:43,020 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/knuth_valuebound10.i[948,961] [2024-09-13 02:25:43,042 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-13 02:25:43,060 INFO L204 MainTranslator]: Completed translation [2024-09-13 02:25:43,062 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:25:43 WrapperNode [2024-09-13 02:25:43,062 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-13 02:25:43,063 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-13 02:25:43,063 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-13 02:25:43,064 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-13 02:25:43,071 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:25:43" (1/1) ... [2024-09-13 02:25:43,086 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:25:43" (1/1) ... [2024-09-13 02:25:43,096 INFO L138 Inliner]: procedures = 18, calls = 22, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-13 02:25:43,096 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-13 02:25:43,098 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-13 02:25:43,098 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-13 02:25:43,098 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-13 02:25:43,108 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:25:43" (1/1) ... [2024-09-13 02:25:43,108 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:25:43" (1/1) ... [2024-09-13 02:25:43,111 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:25:43" (1/1) ... [2024-09-13 02:25:43,131 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2024-09-13 02:25:43,131 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:25:43" (1/1) ... [2024-09-13 02:25:43,137 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:25:43" (1/1) ... [2024-09-13 02:25:43,151 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:25:43" (1/1) ... [2024-09-13 02:25:43,156 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:25:43" (1/1) ... [2024-09-13 02:25:43,159 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:25:43" (1/1) ... [2024-09-13 02:25:43,164 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:25:43" (1/1) ... [2024-09-13 02:25:43,167 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-13 02:25:43,172 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-13 02:25:43,172 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-13 02:25:43,172 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-13 02:25:43,173 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:25:43" (1/1) ... [2024-09-13 02:25:43,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-13 02:25:43,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 02:25:43,210 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-13 02:25:43,212 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-13 02:25:43,260 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-13 02:25:43,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-09-13 02:25:43,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-09-13 02:25:43,260 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-13 02:25:43,262 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-13 02:25:43,262 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-13 02:25:43,262 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-13 02:25:43,262 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-13 02:25:43,262 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-13 02:25:43,262 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-13 02:25:43,262 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-13 02:25:43,262 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-13 02:25:43,262 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-13 02:25:43,342 INFO L242 CfgBuilder]: Building ICFG [2024-09-13 02:25:43,344 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-13 02:25:48,181 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2024-09-13 02:25:48,184 INFO L291 CfgBuilder]: Performing block encoding [2024-09-13 02:25:48,220 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-13 02:25:48,221 INFO L318 CfgBuilder]: Removed 1 assume(true) statements. [2024-09-13 02:25:48,221 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 02:25:48 BoogieIcfgContainer [2024-09-13 02:25:48,221 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-13 02:25:48,223 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-13 02:25:48,223 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-13 02:25:48,229 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-13 02:25:48,229 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.09 02:25:42" (1/3) ... [2024-09-13 02:25:48,230 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ad23730 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 02:25:48, skipping insertion in model container [2024-09-13 02:25:48,230 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:25:43" (2/3) ... [2024-09-13 02:25:48,230 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ad23730 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 02:25:48, skipping insertion in model container [2024-09-13 02:25:48,231 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 02:25:48" (3/3) ... [2024-09-13 02:25:48,232 INFO L112 eAbstractionObserver]: Analyzing ICFG knuth_valuebound10.i [2024-09-13 02:25:48,255 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-13 02:25:48,256 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-13 02:25:48,307 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-13 02:25:48,316 INFO L336 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=All, 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;@45ea268e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-13 02:25:48,316 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-13 02:25:48,321 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 18 states have (on average 1.5) internal successors, (27), 19 states have internal predecessors, (27), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-09-13 02:25:48,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-09-13 02:25:48,329 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 02:25:48,329 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 02:25:48,330 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 02:25:48,337 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 02:25:48,337 INFO L85 PathProgramCache]: Analyzing trace with hash 947536974, now seen corresponding path program 1 times [2024-09-13 02:25:48,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-13 02:25:48,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1535843830] [2024-09-13 02:25:48,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 02:25:48,352 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-09-13 02:25:48,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-13 02:25:48,355 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/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-09-13 02:25:48,357 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/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-09-13 02:25:48,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 02:25:48,696 INFO L262 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-09-13 02:25:48,703 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 02:25:48,723 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-09-13 02:25:48,723 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-13 02:25:48,724 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-13 02:25:48,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1535843830] [2024-09-13 02:25:48,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1535843830] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 02:25:48,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 02:25:48,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-13 02:25:48,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867661728] [2024-09-13 02:25:48,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 02:25:48,733 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-13 02:25:48,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-13 02:25:48,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-13 02:25:48,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-13 02:25:48,757 INFO L87 Difference]: Start difference. First operand has 34 states, 18 states have (on average 1.5) internal successors, (27), 19 states have internal predecessors, (27), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2024-09-13 02:25:48,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 02:25:48,842 INFO L93 Difference]: Finished difference Result 62 states and 95 transitions. [2024-09-13 02:25:48,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-13 02:25:48,845 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 32 [2024-09-13 02:25:48,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 02:25:48,852 INFO L225 Difference]: With dead ends: 62 [2024-09-13 02:25:48,852 INFO L226 Difference]: Without dead ends: 30 [2024-09-13 02:25:48,855 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 31 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-09-13 02:25:48,859 INFO L434 NwaCegarLoop]: 41 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-13 02:25:48,860 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 41 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-13 02:25:48,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-09-13 02:25:48,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-09-13 02:25:48,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-09-13 02:25:48,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2024-09-13 02:25:48,904 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 39 transitions. Word has length 32 [2024-09-13 02:25:48,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 02:25:48,905 INFO L474 AbstractCegarLoop]: Abstraction has 30 states and 39 transitions. [2024-09-13 02:25:48,905 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2024-09-13 02:25:48,906 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 02:25:48,906 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2024-09-13 02:25:48,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-09-13 02:25:48,910 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 02:25:48,910 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 02:25:48,927 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/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-09-13 02:25:49,114 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/certificate-witnesses-artifact/automizer/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-09-13 02:25:49,115 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 02:25:49,115 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 02:25:49,116 INFO L85 PathProgramCache]: Analyzing trace with hash -931917038, now seen corresponding path program 1 times [2024-09-13 02:25:49,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-13 02:25:49,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2010869503] [2024-09-13 02:25:49,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 02:25:49,117 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-09-13 02:25:49,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-13 02:25:49,120 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/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-09-13 02:25:49,137 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/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-09-13 02:25:49,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 02:25:49,959 INFO L262 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-09-13 02:25:49,963 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 02:25:56,618 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-09-13 02:25:56,618 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 02:26:09,313 WARN L876 $PredicateComparison]: unable to prove that (= (bvmul (_ bv8 32) c_main_~n~0) (let ((.cse3 (bvadd c_main_~a~0 (_ bv4294967294 32)))) (let ((.cse0 (bvudiv c_main_~n~0 .cse3)) (.cse2 (bvurem c_main_~n~0 c_main_~a~0)) (.cse1 (bvneg (bvudiv c_main_~n~0 c_main_~a~0)))) (bvadd (bvneg (bvmul c_main_~a~0 (bvadd (bvmul (_ bv8 32) .cse0) (bvmul .cse1 (_ bv8 32))))) (bvmul (_ bv4 32) (bvmul .cse0 c_main_~a~0 c_main_~a~0)) (bvmul (_ bv8 32) .cse2) (bvmul (_ bv4 32) (bvmul c_main_~a~0 (bvurem c_main_~n~0 .cse3))) (bvneg (bvmul c_main_~a~0 (bvmul (_ bv4 32) .cse2))) (bvmul (_ bv4 32) (bvmul .cse1 c_main_~a~0 c_main_~a~0)))))) is different from true [2024-09-13 02:26:21,986 WARN L293 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 02:26:26,192 WARN L876 $PredicateComparison]: unable to prove that (or (= (bvmul (_ bv8 32) c_main_~n~0) (let ((.cse3 (bvadd c_main_~a~0 (_ bv4294967294 32)))) (let ((.cse0 (bvudiv c_main_~n~0 .cse3)) (.cse2 (bvurem c_main_~n~0 c_main_~a~0)) (.cse1 (bvneg (bvudiv c_main_~n~0 c_main_~a~0)))) (bvadd (bvneg (bvmul c_main_~a~0 (bvadd (bvmul (_ bv8 32) .cse0) (bvmul .cse1 (_ bv8 32))))) (bvmul (_ bv4 32) (bvmul .cse0 c_main_~a~0 c_main_~a~0)) (bvmul (_ bv8 32) .cse2) (bvmul (_ bv4 32) (bvmul c_main_~a~0 (bvurem c_main_~n~0 .cse3))) (bvneg (bvmul c_main_~a~0 (bvmul (_ bv4 32) .cse2))) (bvmul (_ bv4 32) (bvmul .cse1 c_main_~a~0 c_main_~a~0)))))) (not (bvugt c_main_~a~0 (_ bv2 32)))) is different from true [2024-09-13 02:26:38,387 WARN L293 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 02:26:46,630 WARN L876 $PredicateComparison]: unable to prove that (or (not (= |c_assume_abort_if_not_#in~cond| (_ bv0 32))) (forall ((v_main_~a~0_BEFORE_CALL_3 (_ BitVec 32)) (v_main_~n~0_BEFORE_CALL_5 (_ BitVec 32))) (or (bvugt v_main_~a~0_BEFORE_CALL_3 (_ bv2 32)) (= (bvmul (_ bv8 32) v_main_~n~0_BEFORE_CALL_5) (let ((.cse0 (bvadd v_main_~a~0_BEFORE_CALL_3 (_ bv4294967294 32)))) (let ((.cse2 (bvurem v_main_~n~0_BEFORE_CALL_5 v_main_~a~0_BEFORE_CALL_3)) (.cse1 (bvudiv v_main_~n~0_BEFORE_CALL_5 .cse0)) (.cse3 (bvneg (bvudiv v_main_~n~0_BEFORE_CALL_5 v_main_~a~0_BEFORE_CALL_3)))) (bvadd (bvmul (_ bv4 32) (bvmul v_main_~a~0_BEFORE_CALL_3 (bvurem v_main_~n~0_BEFORE_CALL_5 .cse0))) (bvmul (_ bv4 32) (bvmul v_main_~a~0_BEFORE_CALL_3 v_main_~a~0_BEFORE_CALL_3 .cse1)) (bvneg (bvmul (bvmul .cse2 (_ bv4 32)) v_main_~a~0_BEFORE_CALL_3)) (bvmul .cse2 (_ bv8 32)) (bvmul (_ bv4 32) (bvmul v_main_~a~0_BEFORE_CALL_3 v_main_~a~0_BEFORE_CALL_3 .cse3)) (bvneg (bvmul v_main_~a~0_BEFORE_CALL_3 (bvadd (bvmul (_ bv8 32) .cse1) (bvmul (_ bv8 32) .cse3))))))))))) is different from true [2024-09-13 02:26:58,808 WARN L293 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 02:27:15,335 WARN L293 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 02:27:23,657 WARN L876 $PredicateComparison]: unable to prove that (or (= (_ bv0 32) c_assume_abort_if_not_~cond) (not (= |c_assume_abort_if_not_#in~cond| (_ bv0 32))) (forall ((v_main_~a~0_BEFORE_CALL_3 (_ BitVec 32)) (v_main_~n~0_BEFORE_CALL_5 (_ BitVec 32))) (or (bvugt v_main_~a~0_BEFORE_CALL_3 (_ bv2 32)) (= (bvmul (_ bv8 32) v_main_~n~0_BEFORE_CALL_5) (let ((.cse0 (bvadd v_main_~a~0_BEFORE_CALL_3 (_ bv4294967294 32)))) (let ((.cse2 (bvurem v_main_~n~0_BEFORE_CALL_5 v_main_~a~0_BEFORE_CALL_3)) (.cse1 (bvudiv v_main_~n~0_BEFORE_CALL_5 .cse0)) (.cse3 (bvneg (bvudiv v_main_~n~0_BEFORE_CALL_5 v_main_~a~0_BEFORE_CALL_3)))) (bvadd (bvmul (_ bv4 32) (bvmul v_main_~a~0_BEFORE_CALL_3 (bvurem v_main_~n~0_BEFORE_CALL_5 .cse0))) (bvmul (_ bv4 32) (bvmul v_main_~a~0_BEFORE_CALL_3 v_main_~a~0_BEFORE_CALL_3 .cse1)) (bvneg (bvmul (bvmul .cse2 (_ bv4 32)) v_main_~a~0_BEFORE_CALL_3)) (bvmul .cse2 (_ bv8 32)) (bvmul (_ bv4 32) (bvmul v_main_~a~0_BEFORE_CALL_3 v_main_~a~0_BEFORE_CALL_3 .cse3)) (bvneg (bvmul v_main_~a~0_BEFORE_CALL_3 (bvadd (bvmul (_ bv8 32) .cse1) (bvmul (_ bv8 32) .cse3))))))))))) is different from true [2024-09-13 02:27:36,139 WARN L293 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 02:27:44,586 WARN L293 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 02:27:56,996 WARN L293 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 02:28:01,192 WARN L876 $PredicateComparison]: unable to prove that (forall ((main_~a~0 (_ BitVec 32))) (or (not (bvule main_~a~0 (_ bv10 32))) (not (bvugt main_~a~0 (_ bv2 32))) (= (bvmul (_ bv8 32) c_main_~n~0) (let ((.cse1 (bvadd (_ bv4294967294 32) main_~a~0))) (let ((.cse2 (bvudiv c_main_~n~0 .cse1)) (.cse0 (bvurem c_main_~n~0 main_~a~0)) (.cse3 (bvneg (bvudiv c_main_~n~0 main_~a~0)))) (bvadd (bvmul .cse0 (_ bv8 32)) (bvmul (bvmul (bvurem c_main_~n~0 .cse1) main_~a~0) (_ bv4 32)) (bvmul (bvmul .cse2 main_~a~0 main_~a~0) (_ bv4 32)) (bvneg (bvmul main_~a~0 (bvadd (bvmul (_ bv8 32) .cse2) (bvmul .cse3 (_ bv8 32))))) (bvneg (bvmul (bvmul .cse0 (_ bv4 32)) main_~a~0)) (bvmul (_ bv4 32) (bvmul .cse3 main_~a~0 main_~a~0)))))))) is different from true [2024-09-13 02:28:01,194 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-13 02:28:01,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2010869503] [2024-09-13 02:28:01,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2010869503] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 02:28:01,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1483884996] [2024-09-13 02:28:01,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 02:28:01,195 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-09-13 02:28:01,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/cvc4 [2024-09-13 02:28:01,198 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-09-13 02:28:01,200 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-09-13 02:28:07,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 02:28:07,813 INFO L262 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-09-13 02:28:07,816 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 02:28:12,724 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-09-13 02:28:12,724 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 02:28:30,654 WARN L293 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 02:28:46,941 WARN L293 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 02:28:51,032 WARN L876 $PredicateComparison]: unable to prove that (or (not (= |c_assume_abort_if_not_#in~cond| (_ bv0 32))) (forall ((v_main_~a~0_BEFORE_CALL_7 (_ BitVec 32)) (v_main_~n~0_BEFORE_CALL_11 (_ BitVec 32))) (or (= (bvmul (_ bv8 32) v_main_~n~0_BEFORE_CALL_11) (let ((.cse3 (bvadd v_main_~a~0_BEFORE_CALL_7 (_ bv4294967294 32)))) (let ((.cse2 (bvneg (bvudiv v_main_~n~0_BEFORE_CALL_11 v_main_~a~0_BEFORE_CALL_7))) (.cse1 (bvudiv v_main_~n~0_BEFORE_CALL_11 .cse3)) (.cse0 (bvurem v_main_~n~0_BEFORE_CALL_11 v_main_~a~0_BEFORE_CALL_7))) (bvadd (bvmul (_ bv8 32) .cse0) (bvmul (_ bv4 32) (bvmul v_main_~a~0_BEFORE_CALL_7 v_main_~a~0_BEFORE_CALL_7 .cse1)) (bvmul (_ bv4 32) (bvmul v_main_~a~0_BEFORE_CALL_7 v_main_~a~0_BEFORE_CALL_7 .cse2)) (bvmul (_ bv4 32) (bvmul (bvurem v_main_~n~0_BEFORE_CALL_11 .cse3) v_main_~a~0_BEFORE_CALL_7)) (bvneg (bvmul (bvadd (bvmul (_ bv8 32) .cse2) (bvmul (_ bv8 32) .cse1)) v_main_~a~0_BEFORE_CALL_7)) (bvneg (bvmul (bvmul (_ bv4 32) .cse0) v_main_~a~0_BEFORE_CALL_7)))))) (bvugt v_main_~a~0_BEFORE_CALL_7 (_ bv2 32))))) is different from true [2024-09-13 02:29:07,289 WARN L293 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 02:29:23,591 WARN L293 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 02:29:27,736 WARN L876 $PredicateComparison]: unable to prove that (or (= (_ bv0 32) c_assume_abort_if_not_~cond) (not (= |c_assume_abort_if_not_#in~cond| (_ bv0 32))) (forall ((v_main_~a~0_BEFORE_CALL_7 (_ BitVec 32)) (v_main_~n~0_BEFORE_CALL_11 (_ BitVec 32))) (or (= (bvmul (_ bv8 32) v_main_~n~0_BEFORE_CALL_11) (let ((.cse3 (bvadd v_main_~a~0_BEFORE_CALL_7 (_ bv4294967294 32)))) (let ((.cse2 (bvneg (bvudiv v_main_~n~0_BEFORE_CALL_11 v_main_~a~0_BEFORE_CALL_7))) (.cse1 (bvudiv v_main_~n~0_BEFORE_CALL_11 .cse3)) (.cse0 (bvurem v_main_~n~0_BEFORE_CALL_11 v_main_~a~0_BEFORE_CALL_7))) (bvadd (bvmul (_ bv8 32) .cse0) (bvmul (_ bv4 32) (bvmul v_main_~a~0_BEFORE_CALL_7 v_main_~a~0_BEFORE_CALL_7 .cse1)) (bvmul (_ bv4 32) (bvmul v_main_~a~0_BEFORE_CALL_7 v_main_~a~0_BEFORE_CALL_7 .cse2)) (bvmul (_ bv4 32) (bvmul (bvurem v_main_~n~0_BEFORE_CALL_11 .cse3) v_main_~a~0_BEFORE_CALL_7)) (bvneg (bvmul (bvadd (bvmul (_ bv8 32) .cse2) (bvmul (_ bv8 32) .cse1)) v_main_~a~0_BEFORE_CALL_7)) (bvneg (bvmul (bvmul (_ bv4 32) .cse0) v_main_~a~0_BEFORE_CALL_7)))))) (bvugt v_main_~a~0_BEFORE_CALL_7 (_ bv2 32))))) is different from true [2024-09-13 02:29:40,178 WARN L293 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 02:29:48,652 WARN L293 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 02:30:01,208 WARN L293 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 02:30:01,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1483884996] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 02:30:01,209 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-13 02:30:01,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 11 [2024-09-13 02:30:01,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448917918] [2024-09-13 02:30:01,210 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-13 02:30:01,211 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-09-13 02:30:01,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-13 02:30:01,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-09-13 02:30:01,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=157, Unknown=7, NotChecked=210, Total=420 [2024-09-13 02:30:01,213 INFO L87 Difference]: Start difference. First operand 30 states and 39 transitions. Second operand has 11 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-09-13 02:30:10,865 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.78s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-13 02:30:14,868 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-13 02:30:18,883 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-13 02:30:22,898 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-13 02:30:26,904 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-13 02:30:36,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 02:30:36,239 INFO L93 Difference]: Finished difference Result 47 states and 62 transitions. [2024-09-13 02:30:36,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-13 02:30:36,249 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 32 [2024-09-13 02:30:36,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 02:30:36,250 INFO L225 Difference]: With dead ends: 47 [2024-09-13 02:30:36,250 INFO L226 Difference]: Without dead ends: 45 [2024-09-13 02:30:36,251 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 41.8s TimeCoverageRelationStatistics Valid=103, Invalid=424, Unknown=7, NotChecked=336, Total=870 [2024-09-13 02:30:36,252 INFO L434 NwaCegarLoop]: 19 mSDtfsCounter, 64 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 28 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 29.1s IncrementalHoareTripleChecker+Time [2024-09-13 02:30:36,252 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 131 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 155 Invalid, 5 Unknown, 0 Unchecked, 29.1s Time] [2024-09-13 02:30:36,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-09-13 02:30:36,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 36. [2024-09-13 02:30:36,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-09-13 02:30:36,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2024-09-13 02:30:36,265 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 45 transitions. Word has length 32 [2024-09-13 02:30:36,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 02:30:36,265 INFO L474 AbstractCegarLoop]: Abstraction has 36 states and 45 transitions. [2024-09-13 02:30:36,266 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-09-13 02:30:36,266 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 02:30:36,266 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2024-09-13 02:30:36,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-09-13 02:30:36,267 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 02:30:36,268 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 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-09-13 02:30:36,283 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/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-09-13 02:30:36,545 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/cvc4 --incremental --print-success --lang smt (4)] Forceful destruction successful, exit code 0 [2024-09-13 02:30:36,668 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/certificate-witnesses-artifact/automizer/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 /storage/repos/certificate-witnesses-artifact/automizer/cvc4 --incremental --print-success --lang smt [2024-09-13 02:30:36,669 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 02:30:36,669 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 02:30:36,669 INFO L85 PathProgramCache]: Analyzing trace with hash 9903818, now seen corresponding path program 1 times [2024-09-13 02:30:36,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-13 02:30:36,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1421147951] [2024-09-13 02:30:36,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 02:30:36,670 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-09-13 02:30:36,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-13 02:30:36,673 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/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-09-13 02:30:36,674 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/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-09-13 02:30:36,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 02:30:36,907 INFO L262 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-13 02:30:36,909 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 02:30:37,803 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-13 02:30:37,803 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-13 02:30:37,803 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-13 02:30:37,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1421147951] [2024-09-13 02:30:37,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1421147951] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 02:30:37,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 02:30:37,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-13 02:30:37,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498669728] [2024-09-13 02:30:37,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 02:30:37,804 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 02:30:37,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-13 02:30:37,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 02:30:37,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-13 02:30:37,805 INFO L87 Difference]: Start difference. First operand 36 states and 45 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-09-13 02:30:39,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 02:30:39,232 INFO L93 Difference]: Finished difference Result 49 states and 63 transitions. [2024-09-13 02:30:39,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 02:30:39,240 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 37 [2024-09-13 02:30:39,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 02:30:39,241 INFO L225 Difference]: With dead ends: 49 [2024-09-13 02:30:39,241 INFO L226 Difference]: Without dead ends: 47 [2024-09-13 02:30:39,241 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-13 02:30:39,242 INFO L434 NwaCegarLoop]: 38 mSDtfsCounter, 6 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-09-13 02:30:39,242 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 138 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-09-13 02:30:39,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-09-13 02:30:39,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 41. [2024-09-13 02:30:39,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 23 states have (on average 1.173913043478261) internal successors, (27), 24 states have internal predecessors, (27), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2024-09-13 02:30:39,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 50 transitions. [2024-09-13 02:30:39,255 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 50 transitions. Word has length 37 [2024-09-13 02:30:39,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 02:30:39,256 INFO L474 AbstractCegarLoop]: Abstraction has 41 states and 50 transitions. [2024-09-13 02:30:39,256 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-09-13 02:30:39,256 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 02:30:39,256 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 50 transitions. [2024-09-13 02:30:39,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-09-13 02:30:39,257 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 02:30:39,258 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 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-09-13 02:30:39,278 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-09-13 02:30:39,458 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/certificate-witnesses-artifact/automizer/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-09-13 02:30:39,458 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 02:30:39,459 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 02:30:39,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1706802642, now seen corresponding path program 1 times [2024-09-13 02:30:39,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-13 02:30:39,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [562349684] [2024-09-13 02:30:39,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 02:30:39,460 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-09-13 02:30:39,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-13 02:30:39,461 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/certificate-witnesses-artifact/automizer/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-09-13 02:30:39,462 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/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-09-13 02:30:40,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 02:30:40,426 INFO L262 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-09-13 02:30:40,428 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 02:30:53,257 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-09-13 02:30:53,257 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 02:31:18,781 WARN L293 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 02:31:27,503 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse8 (bvadd c_main_~a~0 (_ bv4294967294 32)))) (let ((.cse3 (bvneg (bvudiv c_main_~n~0 c_main_~a~0))) (.cse6 (bvurem c_main_~n~0 c_main_~a~0)) (.cse4 (bvudiv c_main_~n~0 .cse8))) (let ((.cse7 (bvmul (_ bv8 32) c_main_~n~0)) (.cse0 (bvmul (_ bv4 32) (bvmul .cse4 c_main_~a~0 c_main_~a~0))) (.cse1 (bvmul (_ bv8 32) .cse6)) (.cse2 (bvmul (_ bv4 32) (bvmul c_main_~a~0 (bvurem c_main_~n~0 .cse8)))) (.cse5 (bvmul (_ bv4 32) (bvmul .cse3 c_main_~a~0 c_main_~a~0)))) (or (= (_ bv0 32) (bvadd .cse0 .cse1 .cse2 (bvneg (bvmul (bvadd (bvmul .cse3 (_ bv4 32)) (bvmul (_ bv4 32) .cse4)) (bvmul (_ bv2 32) c_main_~a~0))) .cse5 (bvneg (bvmul (bvmul (_ bv4 32) c_main_~a~0) .cse6)) (bvneg .cse7))) (not (= .cse7 (bvadd (bvneg (bvmul c_main_~a~0 (bvadd (bvmul (_ bv8 32) .cse4) (bvmul .cse3 (_ bv8 32))))) .cse0 .cse1 .cse2 (bvneg (bvmul c_main_~a~0 (bvmul (_ bv4 32) .cse6))) .cse5))))))) is different from true [2024-09-13 02:31:36,021 WARN L293 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 02:31:44,123 WARN L293 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 02:31:53,241 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse8 (bvadd c_main_~a~0 (_ bv4294967294 32)))) (let ((.cse3 (bvneg (bvudiv c_main_~n~0 c_main_~a~0))) (.cse6 (bvurem c_main_~n~0 c_main_~a~0)) (.cse4 (bvudiv c_main_~n~0 .cse8))) (let ((.cse7 (bvmul (_ bv8 32) c_main_~n~0)) (.cse0 (bvmul (_ bv4 32) (bvmul .cse4 c_main_~a~0 c_main_~a~0))) (.cse1 (bvmul (_ bv8 32) .cse6)) (.cse2 (bvmul (_ bv4 32) (bvmul c_main_~a~0 (bvurem c_main_~n~0 .cse8)))) (.cse5 (bvmul (_ bv4 32) (bvmul .cse3 c_main_~a~0 c_main_~a~0)))) (or (= (_ bv0 32) (bvadd .cse0 .cse1 .cse2 (bvneg (bvmul (bvadd (bvmul .cse3 (_ bv4 32)) (bvmul (_ bv4 32) .cse4)) (bvmul (_ bv2 32) c_main_~a~0))) .cse5 (bvneg (bvmul (bvmul (_ bv4 32) c_main_~a~0) .cse6)) (bvneg .cse7))) (not (= .cse7 (bvadd (bvneg (bvmul c_main_~a~0 (bvadd (bvmul (_ bv8 32) .cse4) (bvmul .cse3 (_ bv8 32))))) .cse0 .cse1 .cse2 (bvneg (bvmul c_main_~a~0 (bvmul (_ bv4 32) .cse6))) .cse5))) (not (bvugt c_main_~a~0 (_ bv2 32))))))) is different from true [2024-09-13 02:32:09,752 WARN L293 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 02:32:17,873 WARN L293 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 02:32:21,924 WARN L876 $PredicateComparison]: unable to prove that (or (not (= |c_assume_abort_if_not_#in~cond| (_ bv0 32))) (forall ((v_main_~a~0_BEFORE_CALL_16 (_ BitVec 32)) (v_main_~n~0_BEFORE_CALL_21 (_ BitVec 32))) (let ((.cse8 (bvadd v_main_~a~0_BEFORE_CALL_16 (_ bv4294967294 32)))) (let ((.cse4 (bvudiv v_main_~n~0_BEFORE_CALL_21 .cse8)) (.cse0 (bvurem v_main_~n~0_BEFORE_CALL_21 v_main_~a~0_BEFORE_CALL_16)) (.cse5 (bvneg (bvudiv v_main_~n~0_BEFORE_CALL_21 v_main_~a~0_BEFORE_CALL_16)))) (let ((.cse6 (bvmul (_ bv8 32) v_main_~n~0_BEFORE_CALL_21)) (.cse1 (bvmul (bvmul v_main_~a~0_BEFORE_CALL_16 v_main_~a~0_BEFORE_CALL_16 .cse5) (_ bv4 32))) (.cse2 (bvmul (_ bv4 32) (bvmul (bvurem v_main_~n~0_BEFORE_CALL_21 .cse8) v_main_~a~0_BEFORE_CALL_16))) (.cse3 (bvmul (_ bv8 32) .cse0)) (.cse7 (bvmul (_ bv4 32) (bvmul .cse4 v_main_~a~0_BEFORE_CALL_16 v_main_~a~0_BEFORE_CALL_16)))) (or (= (_ bv0 32) (bvadd (bvneg (bvmul (bvmul (_ bv4 32) v_main_~a~0_BEFORE_CALL_16) .cse0)) .cse1 .cse2 .cse3 (bvneg (bvmul (bvmul (_ bv2 32) v_main_~a~0_BEFORE_CALL_16) (bvadd (bvmul (_ bv4 32) .cse4) (bvmul (_ bv4 32) .cse5)))) (bvneg .cse6) .cse7)) (bvugt v_main_~a~0_BEFORE_CALL_16 (_ bv2 32)) (not (= .cse6 (bvadd (bvneg (bvmul v_main_~a~0_BEFORE_CALL_16 (bvadd (bvmul (_ bv8 32) .cse5) (bvmul (_ bv8 32) .cse4)))) .cse1 .cse2 .cse3 (bvneg (bvmul v_main_~a~0_BEFORE_CALL_16 (bvmul (_ bv4 32) .cse0))) .cse7))))))))) is different from true [2024-09-13 02:32:38,655 WARN L293 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 02:32:46,770 WARN L293 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 02:33:03,371 WARN L293 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 02:33:11,482 WARN L293 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 02:33:15,584 WARN L876 $PredicateComparison]: unable to prove that (or (= (_ bv0 32) c_assume_abort_if_not_~cond) (not (= |c_assume_abort_if_not_#in~cond| (_ bv0 32))) (forall ((v_main_~a~0_BEFORE_CALL_16 (_ BitVec 32)) (v_main_~n~0_BEFORE_CALL_21 (_ BitVec 32))) (let ((.cse8 (bvadd v_main_~a~0_BEFORE_CALL_16 (_ bv4294967294 32)))) (let ((.cse4 (bvudiv v_main_~n~0_BEFORE_CALL_21 .cse8)) (.cse0 (bvurem v_main_~n~0_BEFORE_CALL_21 v_main_~a~0_BEFORE_CALL_16)) (.cse5 (bvneg (bvudiv v_main_~n~0_BEFORE_CALL_21 v_main_~a~0_BEFORE_CALL_16)))) (let ((.cse6 (bvmul (_ bv8 32) v_main_~n~0_BEFORE_CALL_21)) (.cse1 (bvmul (bvmul v_main_~a~0_BEFORE_CALL_16 v_main_~a~0_BEFORE_CALL_16 .cse5) (_ bv4 32))) (.cse2 (bvmul (_ bv4 32) (bvmul (bvurem v_main_~n~0_BEFORE_CALL_21 .cse8) v_main_~a~0_BEFORE_CALL_16))) (.cse3 (bvmul (_ bv8 32) .cse0)) (.cse7 (bvmul (_ bv4 32) (bvmul .cse4 v_main_~a~0_BEFORE_CALL_16 v_main_~a~0_BEFORE_CALL_16)))) (or (= (_ bv0 32) (bvadd (bvneg (bvmul (bvmul (_ bv4 32) v_main_~a~0_BEFORE_CALL_16) .cse0)) .cse1 .cse2 .cse3 (bvneg (bvmul (bvmul (_ bv2 32) v_main_~a~0_BEFORE_CALL_16) (bvadd (bvmul (_ bv4 32) .cse4) (bvmul (_ bv4 32) .cse5)))) (bvneg .cse6) .cse7)) (bvugt v_main_~a~0_BEFORE_CALL_16 (_ bv2 32)) (not (= .cse6 (bvadd (bvneg (bvmul v_main_~a~0_BEFORE_CALL_16 (bvadd (bvmul (_ bv8 32) .cse5) (bvmul (_ bv8 32) .cse4)))) .cse1 .cse2 .cse3 (bvneg (bvmul v_main_~a~0_BEFORE_CALL_16 (bvmul (_ bv4 32) .cse0))) .cse7))))))))) is different from true [2024-09-13 02:33:23,789 WARN L293 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 02:33:31,893 WARN L293 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 02:33:44,769 WARN L293 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 02:33:52,873 WARN L293 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 02:34:01,080 WARN L293 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 02:34:09,668 WARN L876 $PredicateComparison]: unable to prove that (forall ((main_~a~0 (_ BitVec 32))) (let ((.cse8 (bvadd (_ bv4294967294 32) main_~a~0))) (let ((.cse3 (bvneg (bvudiv c_main_~n~0 main_~a~0))) (.cse4 (bvudiv c_main_~n~0 .cse8)) (.cse5 (bvurem c_main_~n~0 main_~a~0))) (let ((.cse6 (bvmul (_ bv8 32) c_main_~n~0)) (.cse0 (bvmul .cse5 (_ bv8 32))) (.cse1 (bvmul (bvmul (bvurem c_main_~n~0 .cse8) main_~a~0) (_ bv4 32))) (.cse2 (bvmul (bvmul .cse4 main_~a~0 main_~a~0) (_ bv4 32))) (.cse7 (bvmul (_ bv4 32) (bvmul .cse3 main_~a~0 main_~a~0)))) (or (not (bvule main_~a~0 (_ bv10 32))) (= (_ bv0 32) (bvadd .cse0 .cse1 .cse2 (bvneg (bvmul (bvmul (_ bv2 32) main_~a~0) (bvadd (bvmul .cse3 (_ bv4 32)) (bvmul (_ bv4 32) .cse4)))) (bvneg (bvmul .cse5 (bvmul (_ bv4 32) main_~a~0))) (bvneg .cse6) .cse7)) (not (= .cse6 (bvadd .cse0 .cse1 .cse2 (bvneg (bvmul main_~a~0 (bvadd (bvmul (_ bv8 32) .cse4) (bvmul .cse3 (_ bv8 32))))) (bvneg (bvmul (bvmul .cse5 (_ bv4 32)) main_~a~0)) .cse7))) (not (bvugt main_~a~0 (_ bv2 32)))))))) is different from true [2024-09-13 02:34:09,669 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-13 02:34:09,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [562349684] [2024-09-13 02:34:09,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [562349684] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 02:34:09,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1331082808] [2024-09-13 02:34:09,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 02:34:09,669 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-09-13 02:34:09,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/cvc4 [2024-09-13 02:34:09,672 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/certificate-witnesses-artifact/automizer/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-09-13 02:34:09,673 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2024-09-13 02:34:16,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 02:34:16,013 INFO L262 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-09-13 02:34:16,016 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 02:34:24,759 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-09-13 02:34:24,759 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 02:34:37,389 WARN L293 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 02:34:50,393 WARN L293 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 02:34:58,498 WARN L293 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 02:35:19,075 WARN L293 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 02:35:27,197 WARN L293 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 02:35:31,302 WARN L876 $PredicateComparison]: unable to prove that (or (forall ((v_main_~n~0_BEFORE_CALL_31 (_ BitVec 32)) (v_main_~a~0_BEFORE_CALL_25 (_ BitVec 32))) (let ((.cse8 (bvadd v_main_~a~0_BEFORE_CALL_25 (_ bv4294967294 32)))) (let ((.cse0 (bvudiv v_main_~n~0_BEFORE_CALL_31 .cse8)) (.cse6 (bvurem v_main_~n~0_BEFORE_CALL_31 v_main_~a~0_BEFORE_CALL_25)) (.cse1 (bvneg (bvudiv v_main_~n~0_BEFORE_CALL_31 v_main_~a~0_BEFORE_CALL_25)))) (let ((.cse2 (bvmul (_ bv4 32) (bvmul .cse1 v_main_~a~0_BEFORE_CALL_25 v_main_~a~0_BEFORE_CALL_25))) (.cse3 (bvmul (_ bv8 32) .cse6)) (.cse4 (bvmul (_ bv4 32) (bvmul .cse0 v_main_~a~0_BEFORE_CALL_25 v_main_~a~0_BEFORE_CALL_25))) (.cse7 (bvmul (bvmul v_main_~a~0_BEFORE_CALL_25 (bvurem v_main_~n~0_BEFORE_CALL_31 .cse8)) (_ bv4 32))) (.cse5 (bvmul (_ bv8 32) v_main_~n~0_BEFORE_CALL_31))) (or (= (_ bv0 32) (bvadd (bvneg (bvmul (bvmul (_ bv2 32) v_main_~a~0_BEFORE_CALL_25) (bvadd (bvmul .cse0 (_ bv4 32)) (bvmul (_ bv4 32) .cse1)))) .cse2 .cse3 .cse4 (bvneg .cse5) (bvneg (bvmul (bvmul (_ bv4 32) v_main_~a~0_BEFORE_CALL_25) .cse6)) .cse7)) (bvugt v_main_~a~0_BEFORE_CALL_25 (_ bv2 32)) (not (= (bvadd .cse2 (bvneg (bvmul v_main_~a~0_BEFORE_CALL_25 (bvmul (_ bv4 32) .cse6))) .cse3 .cse4 (bvneg (bvmul (bvadd (bvmul .cse0 (_ bv8 32)) (bvmul (_ bv8 32) .cse1)) v_main_~a~0_BEFORE_CALL_25)) .cse7) .cse5))))))) (not (= |c_assume_abort_if_not_#in~cond| (_ bv0 32)))) is different from true [2024-09-13 02:35:47,597 WARN L293 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 02:35:55,714 WARN L293 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 02:36:12,152 WARN L293 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 02:36:20,255 WARN L293 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 02:36:24,406 WARN L876 $PredicateComparison]: unable to prove that (or (= (_ bv0 32) c_assume_abort_if_not_~cond) (forall ((v_main_~n~0_BEFORE_CALL_31 (_ BitVec 32)) (v_main_~a~0_BEFORE_CALL_25 (_ BitVec 32))) (let ((.cse8 (bvadd v_main_~a~0_BEFORE_CALL_25 (_ bv4294967294 32)))) (let ((.cse0 (bvudiv v_main_~n~0_BEFORE_CALL_31 .cse8)) (.cse6 (bvurem v_main_~n~0_BEFORE_CALL_31 v_main_~a~0_BEFORE_CALL_25)) (.cse1 (bvneg (bvudiv v_main_~n~0_BEFORE_CALL_31 v_main_~a~0_BEFORE_CALL_25)))) (let ((.cse2 (bvmul (_ bv4 32) (bvmul .cse1 v_main_~a~0_BEFORE_CALL_25 v_main_~a~0_BEFORE_CALL_25))) (.cse3 (bvmul (_ bv8 32) .cse6)) (.cse4 (bvmul (_ bv4 32) (bvmul .cse0 v_main_~a~0_BEFORE_CALL_25 v_main_~a~0_BEFORE_CALL_25))) (.cse7 (bvmul (bvmul v_main_~a~0_BEFORE_CALL_25 (bvurem v_main_~n~0_BEFORE_CALL_31 .cse8)) (_ bv4 32))) (.cse5 (bvmul (_ bv8 32) v_main_~n~0_BEFORE_CALL_31))) (or (= (_ bv0 32) (bvadd (bvneg (bvmul (bvmul (_ bv2 32) v_main_~a~0_BEFORE_CALL_25) (bvadd (bvmul .cse0 (_ bv4 32)) (bvmul (_ bv4 32) .cse1)))) .cse2 .cse3 .cse4 (bvneg .cse5) (bvneg (bvmul (bvmul (_ bv4 32) v_main_~a~0_BEFORE_CALL_25) .cse6)) .cse7)) (bvugt v_main_~a~0_BEFORE_CALL_25 (_ bv2 32)) (not (= (bvadd .cse2 (bvneg (bvmul v_main_~a~0_BEFORE_CALL_25 (bvmul (_ bv4 32) .cse6))) .cse3 .cse4 (bvneg (bvmul (bvadd (bvmul .cse0 (_ bv8 32)) (bvmul (_ bv8 32) .cse1)) v_main_~a~0_BEFORE_CALL_25)) .cse7) .cse5))))))) (not (= |c_assume_abort_if_not_#in~cond| (_ bv0 32)))) is different from true [2024-09-13 02:36:32,604 WARN L293 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 02:36:40,709 WARN L293 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 02:36:53,450 WARN L293 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 02:37:01,548 WARN L293 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 02:37:09,771 WARN L293 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 02:37:13,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1331082808] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 02:37:13,980 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-13 02:37:13,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 13 [2024-09-13 02:37:13,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051002787] [2024-09-13 02:37:13,981 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-13 02:37:13,981 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-09-13 02:37:13,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-13 02:37:13,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-09-13 02:37:13,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=234, Unknown=7, NotChecked=252, Total=552 [2024-09-13 02:37:13,982 INFO L87 Difference]: Start difference. First operand 41 states and 50 transitions. Second operand has 13 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 4 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2024-09-13 02:37:25,562 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.66s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-13 02:37:29,574 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-13 02:37:33,576 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-13 02:37:37,581 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-13 02:37:41,585 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-13 02:37:45,589 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-13 02:37:49,592 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-13 02:38:02,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 02:38:02,319 INFO L93 Difference]: Finished difference Result 55 states and 68 transitions. [2024-09-13 02:38:02,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-09-13 02:38:02,331 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 4 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 42 [2024-09-13 02:38:02,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 02:38:02,332 INFO L225 Difference]: With dead ends: 55 [2024-09-13 02:38:02,332 INFO L226 Difference]: Without dead ends: 53 [2024-09-13 02:38:02,333 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 56.6s TimeCoverageRelationStatistics Valid=133, Invalid=644, Unknown=7, NotChecked=406, Total=1190 [2024-09-13 02:38:02,334 INFO L434 NwaCegarLoop]: 18 mSDtfsCounter, 68 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 41 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 37.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 38.4s IncrementalHoareTripleChecker+Time [2024-09-13 02:38:02,334 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 106 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 173 Invalid, 7 Unknown, 0 Unchecked, 38.4s Time] [2024-09-13 02:38:02,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-09-13 02:38:02,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 47. [2024-09-13 02:38:02,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 27 states have internal predecessors, (30), 14 states have call successors, (14), 7 states have call predecessors, (14), 6 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2024-09-13 02:38:02,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 57 transitions. [2024-09-13 02:38:02,345 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 57 transitions. Word has length 42 [2024-09-13 02:38:02,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 02:38:02,346 INFO L474 AbstractCegarLoop]: Abstraction has 47 states and 57 transitions. [2024-09-13 02:38:02,346 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 4 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2024-09-13 02:38:02,346 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 02:38:02,346 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 57 transitions. [2024-09-13 02:38:02,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-09-13 02:38:02,348 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 02:38:02,348 INFO L216 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 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, 1, 1, 1] [2024-09-13 02:38:02,364 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-09-13 02:38:02,627 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/cvc4 --incremental --print-success --lang smt (7)] Forceful destruction successful, exit code 0 [2024-09-13 02:38:02,749 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/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 /storage/repos/certificate-witnesses-artifact/automizer/cvc4 --incremental --print-success --lang smt [2024-09-13 02:38:02,749 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 02:38:02,750 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 02:38:02,750 INFO L85 PathProgramCache]: Analyzing trace with hash 621171381, now seen corresponding path program 1 times [2024-09-13 02:38:02,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-13 02:38:02,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1849368585] [2024-09-13 02:38:02,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 02:38:02,750 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-09-13 02:38:02,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-13 02:38:02,753 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/certificate-witnesses-artifact/automizer/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-09-13 02:38:02,754 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/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-09-13 02:38:03,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 02:38:03,116 INFO L262 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-09-13 02:38:03,118 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 02:38:15,936 WARN L293 SmtUtils]: Spent 8.60s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 02:38:25,000 WARN L293 SmtUtils]: Spent 9.06s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 02:38:39,143 WARN L293 SmtUtils]: Spent 9.45s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 02:38:48,374 WARN L293 SmtUtils]: Spent 9.23s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 02:38:52,741 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((main_~n~0 (_ BitVec 32))) (let ((.cse0 (bvadd c_main_~d~0 (_ bv4294967294 32)))) (and (= c_main_~q~0 (bvadd (bvmul (_ bv4 32) (bvneg (bvudiv main_~n~0 c_main_~d~0))) (bvmul (_ bv4 32) (bvudiv main_~n~0 .cse0)))) (= (bvurem main_~n~0 .cse0) c_main_~k~0) (= c_main_~s~0 ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt roundNearestTiesToEven ((_ to_fp_unsigned 11 53) roundNearestTiesToEven main_~n~0)))) (= (bvurem main_~n~0 c_main_~d~0) c_main_~r~0) (bvule main_~n~0 (_ bv10 32))))) (bvugt c_main_~d~0 (_ bv2 32)) (bvule c_main_~d~0 (_ bv10 32))) is different from false [2024-09-13 02:39:01,504 WARN L293 SmtUtils]: Spent 8.65s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 02:39:10,556 WARN L293 SmtUtils]: Spent 9.05s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 02:39:19,640 WARN L293 SmtUtils]: Spent 9.08s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 02:39:28,696 WARN L293 SmtUtils]: Spent 9.06s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 02:39:37,731 WARN L293 SmtUtils]: Spent 9.03s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 02:39:46,576 WARN L293 SmtUtils]: Spent 8.67s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 02:39:55,614 WARN L293 SmtUtils]: Spent 9.04s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 02:40:04,658 WARN L293 SmtUtils]: Spent 9.04s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) Killed by 15