./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound5.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 35987657 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound5.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --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 6437fdc3c0b95eb5fb3a7e28606efb50e2431074b1de5f5cf4c718827adac36d --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 03:35:11,989 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 03:35:11,992 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 03:35:12,031 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 03:35:12,032 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 03:35:12,033 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 03:35:12,037 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 03:35:12,039 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 03:35:12,041 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 03:35:12,045 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 03:35:12,046 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 03:35:12,050 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 03:35:12,051 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 03:35:12,053 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 03:35:12,054 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 03:35:12,056 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 03:35:12,057 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 03:35:12,058 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 03:35:12,060 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 03:35:12,064 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 03:35:12,066 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 03:35:12,067 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 03:35:12,068 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 03:35:12,069 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 03:35:12,070 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 03:35:12,076 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 03:35:12,077 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 03:35:12,077 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 03:35:12,078 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 03:35:12,078 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 03:35:12,079 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 03:35:12,079 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 03:35:12,081 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 03:35:12,082 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 03:35:12,083 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 03:35:12,084 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 03:35:12,084 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 03:35:12,084 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 03:35:12,085 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 03:35:12,085 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 03:35:12,085 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 03:35:12,087 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 03:35:12,095 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-21 03:35:12,136 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 03:35:12,137 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 03:35:12,137 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 03:35:12,137 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 03:35:12,138 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 03:35:12,138 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 03:35:12,139 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 03:35:12,139 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 03:35:12,139 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 03:35:12,140 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 03:35:12,141 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-21 03:35:12,141 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 03:35:12,141 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-21 03:35:12,141 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 03:35:12,142 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 03:35:12,142 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 03:35:12,142 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 03:35:12,142 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-21 03:35:12,143 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 03:35:12,143 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 03:35:12,143 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 03:35:12,143 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 03:35:12,144 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 03:35:12,144 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 03:35:12,144 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 03:35:12,144 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 03:35:12,145 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 03:35:12,145 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 03:35:12,145 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 03:35:12,145 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 03:35:12,146 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 03:35:12,146 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 03:35:12,146 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 03:35:12,146 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 6437fdc3c0b95eb5fb3a7e28606efb50e2431074b1de5f5cf4c718827adac36d [2022-07-21 03:35:12,472 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 03:35:12,503 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 03:35:12,506 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 03:35:12,507 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 03:35:12,507 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 03:35:12,509 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound5.c [2022-07-21 03:35:12,560 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d22662db2/b7f97d9b6834417b80b8c7a05c3e9789/FLAG7b7fdee1b [2022-07-21 03:35:12,967 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 03:35:12,967 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound5.c [2022-07-21 03:35:12,973 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d22662db2/b7f97d9b6834417b80b8c7a05c3e9789/FLAG7b7fdee1b [2022-07-21 03:35:13,384 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d22662db2/b7f97d9b6834417b80b8c7a05c3e9789 [2022-07-21 03:35:13,387 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 03:35:13,388 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 03:35:13,391 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 03:35:13,391 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 03:35:13,394 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 03:35:13,395 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 03:35:13" (1/1) ... [2022-07-21 03:35:13,396 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25faf269 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:35:13, skipping insertion in model container [2022-07-21 03:35:13,396 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 03:35:13" (1/1) ... [2022-07-21 03:35:13,402 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 03:35:13,415 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 03:35:13,543 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound5.c[712,725] [2022-07-21 03:35:13,560 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 03:35:13,570 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 03:35:13,585 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound5.c[712,725] [2022-07-21 03:35:13,588 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 03:35:13,618 INFO L208 MainTranslator]: Completed translation [2022-07-21 03:35:13,618 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:35:13 WrapperNode [2022-07-21 03:35:13,618 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 03:35:13,619 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 03:35:13,619 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 03:35:13,619 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 03:35:13,628 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:35:13" (1/1) ... [2022-07-21 03:35:13,635 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:35:13" (1/1) ... [2022-07-21 03:35:13,650 INFO L137 Inliner]: procedures = 14, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 33 [2022-07-21 03:35:13,651 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 03:35:13,652 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 03:35:13,652 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 03:35:13,652 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 03:35:13,658 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:35:13" (1/1) ... [2022-07-21 03:35:13,658 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:35:13" (1/1) ... [2022-07-21 03:35:13,667 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:35:13" (1/1) ... [2022-07-21 03:35:13,667 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:35:13" (1/1) ... [2022-07-21 03:35:13,679 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:35:13" (1/1) ... [2022-07-21 03:35:13,686 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:35:13" (1/1) ... [2022-07-21 03:35:13,688 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:35:13" (1/1) ... [2022-07-21 03:35:13,690 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 03:35:13,692 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 03:35:13,692 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 03:35:13,693 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 03:35:13,693 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:35:13" (1/1) ... [2022-07-21 03:35:13,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 03:35:13,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 03:35:13,725 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-21 03:35:13,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-21 03:35:13,770 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 03:35:13,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-21 03:35:13,771 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 03:35:13,771 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 03:35:13,771 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-21 03:35:13,771 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-21 03:35:13,829 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 03:35:13,831 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 03:35:13,962 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 03:35:13,969 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 03:35:13,969 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-21 03:35:13,971 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 03:35:13 BoogieIcfgContainer [2022-07-21 03:35:13,971 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 03:35:13,973 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 03:35:13,973 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 03:35:13,975 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 03:35:13,976 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 03:35:13" (1/3) ... [2022-07-21 03:35:13,977 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62259e32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 03:35:13, skipping insertion in model container [2022-07-21 03:35:13,977 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:35:13" (2/3) ... [2022-07-21 03:35:13,977 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62259e32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 03:35:13, skipping insertion in model container [2022-07-21 03:35:13,977 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 03:35:13" (3/3) ... [2022-07-21 03:35:13,979 INFO L111 eAbstractionObserver]: Analyzing ICFG freire1_valuebound5.c [2022-07-21 03:35:13,992 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 03:35:13,992 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-21 03:35:14,052 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 03:35:14,060 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@27065edd, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7b5c78af [2022-07-21 03:35:14,061 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-21 03:35:14,073 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 03:35:14,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-21 03:35:14,080 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 03:35:14,080 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 03:35:14,081 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 03:35:14,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 03:35:14,086 INFO L85 PathProgramCache]: Analyzing trace with hash -589467074, now seen corresponding path program 1 times [2022-07-21 03:35:14,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 03:35:14,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279745140] [2022-07-21 03:35:14,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 03:35:14,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 03:35:14,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 03:35:14,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 03:35:14,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 03:35:14,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279745140] [2022-07-21 03:35:14,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279745140] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 03:35:14,238 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 03:35:14,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 03:35:14,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59273376] [2022-07-21 03:35:14,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 03:35:14,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-21 03:35:14,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 03:35:14,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-21 03:35:14,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-21 03:35:14,276 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 03:35:14,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 03:35:14,292 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2022-07-21 03:35:14,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-21 03:35:14,295 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-07-21 03:35:14,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 03:35:14,301 INFO L225 Difference]: With dead ends: 33 [2022-07-21 03:35:14,301 INFO L226 Difference]: Without dead ends: 14 [2022-07-21 03:35:14,304 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-21 03:35:14,308 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 03:35:14,309 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 03:35:14,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-07-21 03:35:14,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-07-21 03:35:14,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 10 states have (on average 1.2) internal successors, (12), 11 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 03:35:14,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2022-07-21 03:35:14,343 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 9 [2022-07-21 03:35:14,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 03:35:14,343 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2022-07-21 03:35:14,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 03:35:14,344 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-07-21 03:35:14,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-21 03:35:14,345 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 03:35:14,345 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 03:35:14,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-21 03:35:14,346 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 03:35:14,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 03:35:14,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1187327748, now seen corresponding path program 1 times [2022-07-21 03:35:14,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 03:35:14,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673287670] [2022-07-21 03:35:14,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 03:35:14,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 03:35:14,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-21 03:35:14,377 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-21 03:35:14,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-21 03:35:14,415 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-21 03:35:14,416 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-21 03:35:14,417 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-21 03:35:14,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-21 03:35:14,424 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1] [2022-07-21 03:35:14,427 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-21 03:35:14,450 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.07 03:35:14 BoogieIcfgContainer [2022-07-21 03:35:14,451 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-21 03:35:14,453 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-21 03:35:14,453 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-21 03:35:14,453 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-21 03:35:14,454 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 03:35:13" (3/4) ... [2022-07-21 03:35:14,457 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-21 03:35:14,457 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-21 03:35:14,458 INFO L158 Benchmark]: Toolchain (without parser) took 1069.58ms. Allocated memory was 54.5MB in the beginning and 73.4MB in the end (delta: 18.9MB). Free memory was 33.3MB in the beginning and 41.4MB in the end (delta: -8.1MB). Peak memory consumption was 10.9MB. Max. memory is 16.1GB. [2022-07-21 03:35:14,459 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 54.5MB. Free memory was 35.9MB in the beginning and 35.9MB in the end (delta: 43.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 03:35:14,462 INFO L158 Benchmark]: CACSL2BoogieTranslator took 227.44ms. Allocated memory was 54.5MB in the beginning and 73.4MB in the end (delta: 18.9MB). Free memory was 33.1MB in the beginning and 57.3MB in the end (delta: -24.2MB). Peak memory consumption was 9.3MB. Max. memory is 16.1GB. [2022-07-21 03:35:14,463 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.72ms. Allocated memory is still 73.4MB. Free memory was 57.3MB in the beginning and 55.8MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 03:35:14,465 INFO L158 Benchmark]: Boogie Preprocessor took 39.15ms. Allocated memory is still 73.4MB. Free memory was 55.8MB in the beginning and 54.8MB in the end (delta: 964.2kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 03:35:14,465 INFO L158 Benchmark]: RCFGBuilder took 279.48ms. Allocated memory is still 73.4MB. Free memory was 54.6MB in the beginning and 45.9MB in the end (delta: 8.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-21 03:35:14,465 INFO L158 Benchmark]: TraceAbstraction took 478.18ms. Allocated memory is still 73.4MB. Free memory was 45.4MB in the beginning and 41.8MB in the end (delta: 3.6MB). Peak memory consumption was 5.8MB. Max. memory is 16.1GB. [2022-07-21 03:35:14,466 INFO L158 Benchmark]: Witness Printer took 4.68ms. Allocated memory is still 73.4MB. Free memory is still 41.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 03:35:14,471 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 54.5MB. Free memory was 35.9MB in the beginning and 35.9MB in the end (delta: 43.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 227.44ms. Allocated memory was 54.5MB in the beginning and 73.4MB in the end (delta: 18.9MB). Free memory was 33.1MB in the beginning and 57.3MB in the end (delta: -24.2MB). Peak memory consumption was 9.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.72ms. Allocated memory is still 73.4MB. Free memory was 57.3MB in the beginning and 55.8MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 39.15ms. Allocated memory is still 73.4MB. Free memory was 55.8MB in the beginning and 54.8MB in the end (delta: 964.2kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 279.48ms. Allocated memory is still 73.4MB. Free memory was 54.6MB in the beginning and 45.9MB in the end (delta: 8.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 478.18ms. Allocated memory is still 73.4MB. Free memory was 45.4MB in the beginning and 41.8MB in the end (delta: 3.6MB). Peak memory consumption was 5.8MB. Max. memory is 16.1GB. * Witness Printer took 4.68ms. Allocated memory is still 73.4MB. Free memory is still 41.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of to_int at line 33, overapproximation of someBinaryDOUBLEComparisonOperation at line 28, overapproximation of someBinaryArithmeticDOUBLEoperation at line 29. Possible FailurePath: [L25] int r; [L26] double a, x; [L27] a = __VERIFIER_nondet_double() [L28] CALL assume_abort_if_not(a>=0 && a<=5) [L14] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L28] RET assume_abort_if_not(a>=0 && a<=5) [L29] x = a / 2.0 [L30] r = 0 VAL [r=0] [L32] COND TRUE 1 VAL [r=0] [L33] CALL __VERIFIER_assert((int)(r*r - a - r + 2*x) == 0) VAL [\old(cond)=0] [L17] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L19] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 18 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.4s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 19 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 19 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 18 NumberOfCodeBlocks, 18 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 8 ConstructedInterpolants, 0 QuantifiedInterpolants, 8 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-07-21 03:35:14,515 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound5.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --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 6437fdc3c0b95eb5fb3a7e28606efb50e2431074b1de5f5cf4c718827adac36d --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 03:35:16,370 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 03:35:16,372 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 03:35:16,406 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 03:35:16,407 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 03:35:16,408 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 03:35:16,412 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 03:35:16,414 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 03:35:16,425 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 03:35:16,430 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 03:35:16,431 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 03:35:16,433 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 03:35:16,433 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 03:35:16,435 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 03:35:16,437 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 03:35:16,438 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 03:35:16,439 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 03:35:16,440 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 03:35:16,441 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 03:35:16,443 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 03:35:16,444 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 03:35:16,445 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 03:35:16,446 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 03:35:16,448 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 03:35:16,448 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 03:35:16,453 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 03:35:16,453 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 03:35:16,454 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 03:35:16,454 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 03:35:16,455 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 03:35:16,456 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 03:35:16,456 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 03:35:16,457 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 03:35:16,458 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 03:35:16,459 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 03:35:16,460 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 03:35:16,460 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 03:35:16,461 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 03:35:16,461 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 03:35:16,461 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 03:35:16,462 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 03:35:16,464 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 03:35:16,467 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-21 03:35:16,488 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 03:35:16,489 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 03:35:16,489 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 03:35:16,489 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 03:35:16,490 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 03:35:16,490 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 03:35:16,491 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 03:35:16,491 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 03:35:16,492 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 03:35:16,493 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 03:35:16,493 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-21 03:35:16,493 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-21 03:35:16,493 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 03:35:16,493 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 03:35:16,494 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 03:35:16,494 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 03:35:16,494 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-21 03:35:16,494 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-21 03:35:16,494 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-21 03:35:16,495 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-21 03:35:16,495 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 03:35:16,495 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 03:35:16,495 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 03:35:16,496 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 03:35:16,496 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 03:35:16,496 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 03:35:16,496 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 03:35:16,496 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 03:35:16,497 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 03:35:16,497 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 03:35:16,497 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-21 03:35:16,497 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-21 03:35:16,498 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 03:35:16,498 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 03:35:16,498 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 03:35:16,498 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-21 03:35:16,498 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 6437fdc3c0b95eb5fb3a7e28606efb50e2431074b1de5f5cf4c718827adac36d [2022-07-21 03:35:16,824 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 03:35:16,846 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 03:35:16,848 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 03:35:16,849 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 03:35:16,855 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 03:35:16,857 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound5.c [2022-07-21 03:35:16,920 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f3633945/da5ec15f54894f04af69bfba2291209a/FLAG8bb011bb5 [2022-07-21 03:35:17,358 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 03:35:17,359 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound5.c [2022-07-21 03:35:17,365 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f3633945/da5ec15f54894f04af69bfba2291209a/FLAG8bb011bb5 [2022-07-21 03:35:17,772 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f3633945/da5ec15f54894f04af69bfba2291209a [2022-07-21 03:35:17,774 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 03:35:17,775 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 03:35:17,778 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 03:35:17,778 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 03:35:17,781 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 03:35:17,785 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 03:35:17" (1/1) ... [2022-07-21 03:35:17,786 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3bea90fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:35:17, skipping insertion in model container [2022-07-21 03:35:17,787 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 03:35:17" (1/1) ... [2022-07-21 03:35:17,793 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 03:35:17,806 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 03:35:17,943 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound5.c[712,725] [2022-07-21 03:35:17,968 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 03:35:17,980 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 03:35:18,001 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound5.c[712,725] [2022-07-21 03:35:18,014 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 03:35:18,049 INFO L208 MainTranslator]: Completed translation [2022-07-21 03:35:18,052 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:35:18 WrapperNode [2022-07-21 03:35:18,052 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 03:35:18,054 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 03:35:18,055 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 03:35:18,055 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 03:35:18,061 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:35:18" (1/1) ... [2022-07-21 03:35:18,077 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:35:18" (1/1) ... [2022-07-21 03:35:18,093 INFO L137 Inliner]: procedures = 15, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 34 [2022-07-21 03:35:18,094 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 03:35:18,095 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 03:35:18,095 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 03:35:18,096 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 03:35:18,102 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:35:18" (1/1) ... [2022-07-21 03:35:18,103 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:35:18" (1/1) ... [2022-07-21 03:35:18,108 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:35:18" (1/1) ... [2022-07-21 03:35:18,109 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:35:18" (1/1) ... [2022-07-21 03:35:18,125 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:35:18" (1/1) ... [2022-07-21 03:35:18,131 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:35:18" (1/1) ... [2022-07-21 03:35:18,136 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:35:18" (1/1) ... [2022-07-21 03:35:18,140 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 03:35:18,142 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 03:35:18,143 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 03:35:18,143 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 03:35:18,144 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:35:18" (1/1) ... [2022-07-21 03:35:18,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 03:35:18,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 03:35:18,177 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-21 03:35:18,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-21 03:35:18,218 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 03:35:18,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-21 03:35:18,219 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 03:35:18,219 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 03:35:18,219 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-21 03:35:18,219 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-21 03:35:18,283 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 03:35:18,285 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 03:35:18,978 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 03:35:18,983 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 03:35:18,983 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-21 03:35:18,985 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 03:35:18 BoogieIcfgContainer [2022-07-21 03:35:18,985 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 03:35:18,989 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 03:35:18,989 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 03:35:18,992 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 03:35:18,992 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 03:35:17" (1/3) ... [2022-07-21 03:35:18,993 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d091299 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 03:35:18, skipping insertion in model container [2022-07-21 03:35:18,993 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:35:18" (2/3) ... [2022-07-21 03:35:18,993 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d091299 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 03:35:18, skipping insertion in model container [2022-07-21 03:35:18,993 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 03:35:18" (3/3) ... [2022-07-21 03:35:18,994 INFO L111 eAbstractionObserver]: Analyzing ICFG freire1_valuebound5.c [2022-07-21 03:35:19,004 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 03:35:19,004 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-21 03:35:19,049 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 03:35:19,055 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@69b9c0f1, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5711d6f6 [2022-07-21 03:35:19,056 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-21 03:35:19,059 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 03:35:19,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-21 03:35:19,065 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 03:35:19,066 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 03:35:19,075 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 03:35:19,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 03:35:19,081 INFO L85 PathProgramCache]: Analyzing trace with hash -589467074, now seen corresponding path program 1 times [2022-07-21 03:35:19,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 03:35:19,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1883363224] [2022-07-21 03:35:19,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 03:35:19,092 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 03:35:19,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 03:35:19,095 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 03:35:19,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-21 03:35:19,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 03:35:19,431 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-21 03:35:19,434 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 03:35:19,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 03:35:19,448 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 03:35:19,449 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 03:35:19,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1883363224] [2022-07-21 03:35:19,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1883363224] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 03:35:19,450 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 03:35:19,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 03:35:19,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858911810] [2022-07-21 03:35:19,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 03:35:19,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-21 03:35:19,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 03:35:19,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-21 03:35:19,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-21 03:35:19,480 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 03:35:19,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 03:35:19,495 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2022-07-21 03:35:19,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-21 03:35:19,496 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-07-21 03:35:19,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 03:35:19,501 INFO L225 Difference]: With dead ends: 33 [2022-07-21 03:35:19,501 INFO L226 Difference]: Without dead ends: 14 [2022-07-21 03:35:19,503 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-21 03:35:19,506 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 03:35:19,507 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 03:35:19,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-07-21 03:35:19,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-07-21 03:35:19,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 10 states have (on average 1.2) internal successors, (12), 11 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 03:35:19,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2022-07-21 03:35:19,534 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 9 [2022-07-21 03:35:19,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 03:35:19,534 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2022-07-21 03:35:19,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 03:35:19,535 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-07-21 03:35:19,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-21 03:35:19,535 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 03:35:19,536 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 03:35:19,558 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-07-21 03:35:19,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 03:35:19,756 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 03:35:19,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 03:35:19,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1187327748, now seen corresponding path program 1 times [2022-07-21 03:35:19,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 03:35:19,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2093262812] [2022-07-21 03:35:19,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 03:35:19,758 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 03:35:19,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 03:35:19,760 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 03:35:19,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-21 03:35:20,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 03:35:20,662 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-21 03:35:20,664 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 03:36:17,732 WARN L833 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (and (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven (_ bv5 32))) (let ((.cse0 (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse1 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1|) .cse1) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven 2.0))))) (_ bv0 32)))) (or (and (not .cse0) (= |c___VERIFIER_assert_#in~cond| (_ bv0 32))) (and .cse0 (= |c___VERIFIER_assert_#in~cond| (_ bv1 32))))) (fp.geq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| .cse1)))) is different from false [2022-07-21 03:36:19,784 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (and (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven (_ bv5 32))) (let ((.cse0 (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse1 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1|) .cse1) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven 2.0))))) (_ bv0 32)))) (or (and (not .cse0) (= |c___VERIFIER_assert_#in~cond| (_ bv0 32))) (and .cse0 (= |c___VERIFIER_assert_#in~cond| (_ bv1 32))))) (fp.geq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| .cse1)))) is different from true [2022-07-21 03:37:12,600 WARN L833 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (and (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven (_ bv5 32))) (fp.geq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| .cse0) (let ((.cse1 (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse0 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1|) .cse0) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven 2.0))))) (_ bv0 32)))) (or (and (= (_ bv1 32) c___VERIFIER_assert_~cond) .cse1) (and (not .cse1) (= (_ bv0 32) c___VERIFIER_assert_~cond))))))) is different from false [2022-07-21 03:37:14,642 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (and (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven (_ bv5 32))) (fp.geq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| .cse0) (let ((.cse1 (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse0 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1|) .cse0) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven 2.0))))) (_ bv0 32)))) (or (and (= (_ bv1 32) c___VERIFIER_assert_~cond) .cse1) (and (not .cse1) (= (_ bv0 32) c___VERIFIER_assert_~cond))))))) is different from true [2022-07-21 03:37:31,234 WARN L833 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (and (not (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse0 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1|) .cse0) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven 2.0))))) (_ bv0 32))) (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven (_ bv5 32))) (fp.geq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| .cse0)))) is different from false [2022-07-21 03:37:33,276 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (and (not (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse0 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1|) .cse0) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven 2.0))))) (_ bv0 32))) (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven (_ bv5 32))) (fp.geq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| .cse0)))) is different from true [2022-07-21 03:37:33,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 03:37:33,277 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 03:37:33,277 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 03:37:33,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2093262812] [2022-07-21 03:37:33,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2093262812] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 03:37:33,277 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 03:37:33,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 03:37:33,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728201912] [2022-07-21 03:37:33,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 03:37:33,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 03:37:33,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 03:37:33,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 03:37:33,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=17, Unknown=6, NotChecked=30, Total=72 [2022-07-21 03:37:33,280 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 9 states, 8 states have (on average 1.0) internal successors, (8), 7 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 03:37:44,381 WARN L233 SmtUtils]: Spent 9.03s on a formula simplification. DAG size of input: 28 DAG size of output: 21 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-21 03:37:46,605 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 03:37:48,608 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 03:37:50,745 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (and (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven (_ bv5 32))) (let ((.cse0 (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse1 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1|) .cse1) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven 2.0))))) (_ bv0 32)))) (or (and (not .cse0) (= |c___VERIFIER_assert_#in~cond| (_ bv0 32))) (and .cse0 (= |c___VERIFIER_assert_#in~cond| (_ bv1 32))))) (fp.geq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| .cse1)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-07-21 03:37:52,787 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (and (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven (_ bv5 32))) (let ((.cse0 (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse1 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1|) .cse1) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven 2.0))))) (_ bv0 32)))) (or (and (not .cse0) (= |c___VERIFIER_assert_#in~cond| (_ bv0 32))) (and .cse0 (= |c___VERIFIER_assert_#in~cond| (_ bv1 32))))) (fp.geq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| .cse1)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-07-21 03:37:56,511 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 03:37:58,516 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 03:38:00,948 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, RoundingMode, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 03:38:01,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 03:38:01,525 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2022-07-21 03:38:01,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 03:38:01,547 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.0) internal successors, (8), 7 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-07-21 03:38:01,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 03:38:01,549 INFO L225 Difference]: With dead ends: 30 [2022-07-21 03:38:01,549 INFO L226 Difference]: Without dead ends: 28 [2022-07-21 03:38:01,550 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 36.2s TimeCoverageRelationStatistics Valid=33, Invalid=31, Unknown=8, NotChecked=60, Total=132 [2022-07-21 03:38:01,551 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 21 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 10 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 81 IncrementalHoareTripleChecker+Unchecked, 13.7s IncrementalHoareTripleChecker+Time [2022-07-21 03:38:01,552 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 32 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 12 Invalid, 5 Unknown, 81 Unchecked, 13.7s Time] [2022-07-21 03:38:01,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-07-21 03:38:01,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2022-07-21 03:38:01,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 20 states have internal predecessors, (22), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 03:38:01,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2022-07-21 03:38:01,572 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 9 [2022-07-21 03:38:01,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 03:38:01,572 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2022-07-21 03:38:01,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.0) internal successors, (8), 7 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 03:38:01,572 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-07-21 03:38:01,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-21 03:38:01,573 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 03:38:01,574 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 03:38:01,590 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-21 03:38:01,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 03:38:01,776 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 03:38:01,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 03:38:01,776 INFO L85 PathProgramCache]: Analyzing trace with hash -713464030, now seen corresponding path program 1 times [2022-07-21 03:38:01,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 03:38:01,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [769692575] [2022-07-21 03:38:01,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 03:38:01,777 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 03:38:01,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 03:38:01,780 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 03:38:01,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-21 03:38:02,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 03:38:02,077 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-21 03:38:02,078 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 03:38:08,384 WARN L833 $PredicateComparison]: unable to prove that (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~r~0#1|)) |c_ULTIMATE.start_main_~a~0#1|) ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~r~0#1|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |c_ULTIMATE.start_main_~x~0#1|))) (_ bv0 32)) is different from false [2022-07-21 03:38:10,460 WARN L855 $PredicateComparison]: unable to prove that (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~r~0#1|)) |c_ULTIMATE.start_main_~a~0#1|) ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~r~0#1|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |c_ULTIMATE.start_main_~x~0#1|))) (_ bv0 32)) is different from true [2022-07-21 03:38:22,927 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2|))) (_ bv0 32))) (= |c___VERIFIER_assert_#in~cond| (_ bv1 32))) is different from false [2022-07-21 03:38:31,268 WARN L833 $PredicateComparison]: unable to prove that (and (= (_ bv1 32) c___VERIFIER_assert_~cond) (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2|))) (_ bv0 32)))) is different from false [2022-07-21 03:38:31,276 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-07-21 03:38:31,277 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 03:38:56,218 WARN L233 SmtUtils]: Spent 16.52s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-07-21 03:39:12,736 WARN L233 SmtUtils]: Spent 16.52s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 316] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-07-21 03:39:18,965 WARN L855 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3|) ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3|))) (_ bv0 32))) (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) is different from true [2022-07-21 03:39:29,337 WARN L855 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3|) ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3|))) (_ bv0 32))) (= (_ bv0 32) c___VERIFIER_assert_~cond) (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) is different from true [2022-07-21 03:39:29,341 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-07-21 03:39:29,341 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 03:39:29,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [769692575] [2022-07-21 03:39:29,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [769692575] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 03:39:29,341 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 03:39:29,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2022-07-21 03:39:29,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136615457] [2022-07-21 03:39:29,342 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 03:39:29,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-21 03:39:29,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 03:39:29,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-21 03:39:29,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=17, Unknown=6, NotChecked=50, Total=90 [2022-07-21 03:39:29,343 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 10 states, 10 states have (on average 1.7) internal successors, (17), 9 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 03:39:31,482 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 03:39:33,483 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 03:39:35,634 WARN L855 $PredicateComparison]: unable to prove that (and (= |c___VERIFIER_assert_#in~cond| c___VERIFIER_assert_~cond) (or (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3|) ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3|))) (_ bv0 32))) (= (_ bv0 32) c___VERIFIER_assert_~cond) (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32))))) is different from true [2022-07-21 03:39:37,704 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32))))) (and (or (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3|) ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3|))) (_ bv0 32))) .cse0) .cse0)) is different from true [2022-07-21 03:39:39,767 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2|))) (_ bv0 32))) (= |c___VERIFIER_assert_#in~cond| (_ bv1 32)) (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) is different from false [2022-07-21 03:39:41,833 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (= (_ bv0 32) c___VERIFIER_assert_~cond))) (and (= |c___VERIFIER_assert_#in~cond| c___VERIFIER_assert_~cond) (= (_ bv1 32) c___VERIFIER_assert_~cond) (not .cse0) (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2|))) (_ bv0 32))) (or (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3|) ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3|))) (_ bv0 32))) .cse0 (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))))) is different from false [2022-07-21 03:39:43,891 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 (= (_ bv0 32) c___VERIFIER_assert_~cond))) (and (= |c___VERIFIER_assert_#in~cond| c___VERIFIER_assert_~cond) (= (_ bv1 32) c___VERIFIER_assert_~cond) (not .cse0) (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2|))) (_ bv0 32))) (or (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3|) ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3|))) (_ bv0 32))) .cse0 (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))))) is different from true [2022-07-21 03:39:43,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 03:39:43,893 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2022-07-21 03:39:43,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 03:39:43,894 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.7) internal successors, (17), 9 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 15 [2022-07-21 03:39:43,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 03:39:43,894 INFO L225 Difference]: With dead ends: 32 [2022-07-21 03:39:43,894 INFO L226 Difference]: Without dead ends: 24 [2022-07-21 03:39:43,895 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 22.8s TimeCoverageRelationStatistics Valid=25, Invalid=20, Unknown=11, NotChecked=126, Total=182 [2022-07-21 03:39:43,896 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 40 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-07-21 03:39:43,896 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 41 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 2 Unknown, 40 Unchecked, 4.2s Time] [2022-07-21 03:39:43,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-07-21 03:39:43,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-07-21 03:39:43,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 03:39:43,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2022-07-21 03:39:43,901 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 15 [2022-07-21 03:39:43,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 03:39:43,902 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2022-07-21 03:39:43,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.7) internal successors, (17), 9 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 03:39:43,902 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-07-21 03:39:43,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-21 03:39:43,903 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 03:39:43,903 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 03:39:43,918 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-07-21 03:39:44,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 03:39:44,107 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 03:39:44,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 03:39:44,107 INFO L85 PathProgramCache]: Analyzing trace with hash -610823942, now seen corresponding path program 1 times [2022-07-21 03:39:44,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 03:39:44,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [192450039] [2022-07-21 03:39:44,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 03:39:44,108 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 03:39:44,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 03:39:44,110 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 03:39:44,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-21 03:39:46,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 03:39:46,522 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-21 03:39:46,524 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 03:40:00,979 WARN L233 SmtUtils]: Spent 6.50s on a formula simplification that was a NOOP. DAG size: 18 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)