./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/floats-esbmc-regression/Double_div.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 20ed64ec 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/floats-esbmc-regression/Double_div.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.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 d14c90708f35eac31ae5d9fda6b5469e825b2252 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis 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/floats-esbmc-regression/Double_div.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.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 d14c90708f35eac31ae5d9fda6b5469e825b2252 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") --- Real Ultimate output --- This is Ultimate 0.2.1-dev-20ed64e [2021-08-26 01:08:20,425 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-26 01:08:20,427 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-26 01:08:20,466 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-26 01:08:20,466 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-26 01:08:20,469 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-26 01:08:20,470 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-26 01:08:20,474 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-26 01:08:20,476 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-26 01:08:20,481 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-26 01:08:20,482 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-26 01:08:20,485 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-26 01:08:20,486 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-26 01:08:20,487 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-26 01:08:20,488 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-26 01:08:20,490 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-26 01:08:20,492 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-26 01:08:20,493 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-26 01:08:20,494 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-26 01:08:20,496 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-26 01:08:20,499 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-26 01:08:20,500 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-26 01:08:20,501 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-26 01:08:20,502 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-26 01:08:20,504 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-26 01:08:20,505 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-26 01:08:20,505 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-26 01:08:20,505 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-26 01:08:20,506 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-26 01:08:20,507 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-26 01:08:20,507 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-26 01:08:20,508 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-26 01:08:20,508 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-26 01:08:20,509 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-26 01:08:20,510 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-26 01:08:20,510 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-26 01:08:20,511 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-26 01:08:20,511 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-26 01:08:20,511 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-26 01:08:20,513 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-26 01:08:20,513 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-26 01:08:20,514 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-08-26 01:08:20,541 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-26 01:08:20,542 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-26 01:08:20,543 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-26 01:08:20,543 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-26 01:08:20,544 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-26 01:08:20,544 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-26 01:08:20,544 INFO L138 SettingsManager]: * Use SBE=true [2021-08-26 01:08:20,545 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-26 01:08:20,545 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-26 01:08:20,545 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-26 01:08:20,546 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-26 01:08:20,546 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-26 01:08:20,546 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-26 01:08:20,546 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-26 01:08:20,546 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-26 01:08:20,546 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-26 01:08:20,547 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-26 01:08:20,547 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-26 01:08:20,547 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-26 01:08:20,547 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-26 01:08:20,547 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-26 01:08:20,547 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-26 01:08:20,547 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-26 01:08:20,548 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-26 01:08:20,548 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-26 01:08:20,548 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-26 01:08:20,548 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-26 01:08:20,548 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-26 01:08:20,548 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-26 01:08:20,548 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-26 01:08:20,549 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 -> d14c90708f35eac31ae5d9fda6b5469e825b2252 [2021-08-26 01:08:20,828 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-26 01:08:20,864 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-26 01:08:20,865 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-26 01:08:20,866 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-26 01:08:20,867 INFO L275 PluginConnector]: CDTParser initialized [2021-08-26 01:08:20,868 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/floats-esbmc-regression/Double_div.i [2021-08-26 01:08:20,915 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1e83c6d3/97c99b1e131045caba33906e37bfcb98/FLAG84ac907c3 [2021-08-26 01:08:21,264 INFO L306 CDTParser]: Found 1 translation units. [2021-08-26 01:08:21,265 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-esbmc-regression/Double_div.i [2021-08-26 01:08:21,269 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1e83c6d3/97c99b1e131045caba33906e37bfcb98/FLAG84ac907c3 [2021-08-26 01:08:21,720 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1e83c6d3/97c99b1e131045caba33906e37bfcb98 [2021-08-26 01:08:21,722 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-26 01:08:21,723 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-26 01:08:21,724 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-26 01:08:21,724 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-26 01:08:21,728 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-26 01:08:21,728 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 01:08:21" (1/1) ... [2021-08-26 01:08:21,729 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e24cc9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:08:21, skipping insertion in model container [2021-08-26 01:08:21,729 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 01:08:21" (1/1) ... [2021-08-26 01:08:21,733 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-26 01:08:21,743 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-26 01:08:21,857 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-esbmc-regression/Double_div.i[804,817] [2021-08-26 01:08:21,867 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-26 01:08:21,880 INFO L203 MainTranslator]: Completed pre-run [2021-08-26 01:08:21,891 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-esbmc-regression/Double_div.i[804,817] [2021-08-26 01:08:21,895 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-26 01:08:21,936 INFO L208 MainTranslator]: Completed translation [2021-08-26 01:08:21,937 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:08:21 WrapperNode [2021-08-26 01:08:21,937 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-26 01:08:21,938 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-26 01:08:21,938 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-26 01:08:21,938 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-26 01:08:21,942 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:08:21" (1/1) ... [2021-08-26 01:08:21,948 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:08:21" (1/1) ... [2021-08-26 01:08:21,958 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-26 01:08:21,959 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-26 01:08:21,959 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-26 01:08:21,960 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-26 01:08:21,964 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:08:21" (1/1) ... [2021-08-26 01:08:21,965 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:08:21" (1/1) ... [2021-08-26 01:08:21,966 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:08:21" (1/1) ... [2021-08-26 01:08:21,966 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:08:21" (1/1) ... [2021-08-26 01:08:21,971 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:08:21" (1/1) ... [2021-08-26 01:08:21,974 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:08:21" (1/1) ... [2021-08-26 01:08:21,978 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:08:21" (1/1) ... [2021-08-26 01:08:21,979 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-26 01:08:21,981 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-26 01:08:21,981 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-26 01:08:21,981 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-26 01:08:21,981 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:08:21" (1/1) ... [2021-08-26 01:08:21,986 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-26 01:08:21,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 01:08:22,000 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) [2021-08-26 01:08:22,019 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 [2021-08-26 01:08:22,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-26 01:08:22,032 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-26 01:08:22,034 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-26 01:08:22,034 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-26 01:08:22,198 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-26 01:08:22,199 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-08-26 01:08:22,200 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 01:08:22 BoogieIcfgContainer [2021-08-26 01:08:22,200 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-26 01:08:22,201 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-26 01:08:22,201 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-26 01:08:22,204 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-26 01:08:22,204 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 01:08:21" (1/3) ... [2021-08-26 01:08:22,204 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f64c85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 01:08:22, skipping insertion in model container [2021-08-26 01:08:22,205 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:08:21" (2/3) ... [2021-08-26 01:08:22,205 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f64c85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 01:08:22, skipping insertion in model container [2021-08-26 01:08:22,205 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 01:08:22" (3/3) ... [2021-08-26 01:08:22,206 INFO L111 eAbstractionObserver]: Analyzing ICFG Double_div.i [2021-08-26 01:08:22,211 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-26 01:08:22,212 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-08-26 01:08:22,257 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-26 01:08:22,263 INFO L339 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, mConcurrency=FINITE_AUTOMATA, 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, mLoopAccelerationTechnique=FAST_UPR [2021-08-26 01:08:22,263 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-08-26 01:08:22,273 INFO L276 IsEmpty]: Start isEmpty. Operand has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:08:22,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-08-26 01:08:22,277 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 01:08:22,277 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-08-26 01:08:22,278 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 01:08:22,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 01:08:22,282 INFO L82 PathProgramCache]: Analyzing trace with hash 889633835, now seen corresponding path program 1 times [2021-08-26 01:08:22,289 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 01:08:22,289 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714935574] [2021-08-26 01:08:22,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 01:08:22,290 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 01:08:22,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-26 01:08:22,362 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-26 01:08:22,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-26 01:08:22,399 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-26 01:08:22,401 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-08-26 01:08:22,402 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 01:08:22,404 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-26 01:08:22,407 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-26 01:08:22,419 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 01:08:22 BoogieIcfgContainer [2021-08-26 01:08:22,419 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-26 01:08:22,421 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-26 01:08:22,421 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-26 01:08:22,421 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-26 01:08:22,422 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 01:08:22" (3/4) ... [2021-08-26 01:08:22,424 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-08-26 01:08:22,424 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-26 01:08:22,426 INFO L168 Benchmark]: Toolchain (without parser) took 701.56 ms. Allocated memory was 58.7 MB in the beginning and 73.4 MB in the end (delta: 14.7 MB). Free memory was 37.8 MB in the beginning and 47.3 MB in the end (delta: -9.6 MB). Peak memory consumption was 4.1 MB. Max. memory is 16.1 GB. [2021-08-26 01:08:22,426 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 58.7 MB. Free memory was 40.8 MB in the beginning and 40.8 MB in the end (delta: 50.8 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-26 01:08:22,427 INFO L168 Benchmark]: CACSL2BoogieTranslator took 213.22 ms. Allocated memory is still 58.7 MB. Free memory was 37.5 MB in the beginning and 42.9 MB in the end (delta: -5.4 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-08-26 01:08:22,428 INFO L168 Benchmark]: Boogie Procedure Inliner took 20.77 ms. Allocated memory is still 58.7 MB. Free memory was 42.9 MB in the beginning and 41.5 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-26 01:08:22,428 INFO L168 Benchmark]: Boogie Preprocessor took 20.33 ms. Allocated memory is still 58.7 MB. Free memory was 41.5 MB in the beginning and 40.6 MB in the end (delta: 901.4 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-26 01:08:22,429 INFO L168 Benchmark]: RCFGBuilder took 219.77 ms. Allocated memory is still 58.7 MB. Free memory was 40.4 MB in the beginning and 30.1 MB in the end (delta: 10.4 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-08-26 01:08:22,433 INFO L168 Benchmark]: TraceAbstraction took 217.72 ms. Allocated memory was 58.7 MB in the beginning and 73.4 MB in the end (delta: 14.7 MB). Free memory was 29.5 MB in the beginning and 47.6 MB in the end (delta: -18.1 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-26 01:08:22,433 INFO L168 Benchmark]: Witness Printer took 3.13 ms. Allocated memory is still 73.4 MB. Free memory was 47.6 MB in the beginning and 47.3 MB in the end (delta: 282.8 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-26 01:08:22,437 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.15 ms. Allocated memory is still 58.7 MB. Free memory was 40.8 MB in the beginning and 40.8 MB in the end (delta: 50.8 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 213.22 ms. Allocated memory is still 58.7 MB. Free memory was 37.5 MB in the beginning and 42.9 MB in the end (delta: -5.4 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 20.77 ms. Allocated memory is still 58.7 MB. Free memory was 42.9 MB in the beginning and 41.5 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 20.33 ms. Allocated memory is still 58.7 MB. Free memory was 41.5 MB in the beginning and 40.6 MB in the end (delta: 901.4 kB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 219.77 ms. Allocated memory is still 58.7 MB. Free memory was 40.4 MB in the beginning and 30.1 MB in the end (delta: 10.4 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 217.72 ms. Allocated memory was 58.7 MB in the beginning and 73.4 MB in the end (delta: 14.7 MB). Free memory was 29.5 MB in the beginning and 47.6 MB in the end (delta: -18.1 MB). There was no memory consumed. Max. memory is 16.1 GB. * Witness Printer took 3.13 ms. Allocated memory is still 73.4 MB. Free memory was 47.6 MB in the beginning and 47.3 MB in the end (delta: 282.8 kB). There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 13]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 29, overapproximation of someBinaryArithmeticDOUBLEoperation at line 21. Possible FailurePath: [L20] double x = 1.0; [L21] double x1 = x/2.5; [L23] COND FALSE !(x1 != x) [L13] COND TRUE !(cond) [L13] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 11 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 151.3ms, OverallIterations: 1, TraceHistogramMax: 1, EmptinessCheckTime: 6.0ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 7.0ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=11occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 7.7ms SsaConstructionTime, 28.5ms SatisfiabilityAnalysisTime, 0.0ms InterpolantComputationTime, 6 NumberOfCodeBlocks, 6 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 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 [2021-08-26 01:08:22,486 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... ### Bit-precise run ### This is Ultimate 0.2.1-dev-20ed64e [2021-08-26 01:08:24,112 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-26 01:08:24,114 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-26 01:08:24,143 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-26 01:08:24,144 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-26 01:08:24,146 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-26 01:08:24,147 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-26 01:08:24,151 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-26 01:08:24,152 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-26 01:08:24,155 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-26 01:08:24,156 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-26 01:08:24,159 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-26 01:08:24,159 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-26 01:08:24,161 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-26 01:08:24,162 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-26 01:08:24,164 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-26 01:08:24,165 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-26 01:08:24,165 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-26 01:08:24,167 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-26 01:08:24,171 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-26 01:08:24,172 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-26 01:08:24,173 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-26 01:08:24,174 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-26 01:08:24,175 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-26 01:08:24,180 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-26 01:08:24,180 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-26 01:08:24,180 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-26 01:08:24,181 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-26 01:08:24,182 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-26 01:08:24,182 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-26 01:08:24,183 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-26 01:08:24,183 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-26 01:08:24,184 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-26 01:08:24,185 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-26 01:08:24,186 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-26 01:08:24,186 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-26 01:08:24,187 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-26 01:08:24,187 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-26 01:08:24,187 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-26 01:08:24,189 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-26 01:08:24,190 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-26 01:08:24,190 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2021-08-26 01:08:24,219 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-26 01:08:24,219 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-26 01:08:24,220 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-26 01:08:24,220 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-26 01:08:24,221 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-26 01:08:24,221 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-26 01:08:24,222 INFO L138 SettingsManager]: * Use SBE=true [2021-08-26 01:08:24,223 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-26 01:08:24,223 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-26 01:08:24,223 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-26 01:08:24,224 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-26 01:08:24,224 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-26 01:08:24,224 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-26 01:08:24,224 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-26 01:08:24,224 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-08-26 01:08:24,224 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-08-26 01:08:24,225 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-26 01:08:24,225 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-26 01:08:24,225 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-26 01:08:24,225 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-26 01:08:24,225 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-26 01:08:24,225 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-26 01:08:24,225 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-26 01:08:24,226 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-26 01:08:24,226 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-26 01:08:24,232 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-26 01:08:24,233 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-26 01:08:24,233 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-08-26 01:08:24,233 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-08-26 01:08:24,233 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-26 01:08:24,233 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-26 01:08:24,233 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-08-26 01:08:24,233 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 -> d14c90708f35eac31ae5d9fda6b5469e825b2252 [2021-08-26 01:08:24,439 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-26 01:08:24,453 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-26 01:08:24,454 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-26 01:08:24,455 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-26 01:08:24,455 INFO L275 PluginConnector]: CDTParser initialized [2021-08-26 01:08:24,456 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/floats-esbmc-regression/Double_div.i [2021-08-26 01:08:24,493 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eecfc3e88/1f511170c3874db68bc322d6741049ba/FLAG0ad47eb39 [2021-08-26 01:08:24,846 INFO L306 CDTParser]: Found 1 translation units. [2021-08-26 01:08:24,847 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-esbmc-regression/Double_div.i [2021-08-26 01:08:24,851 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eecfc3e88/1f511170c3874db68bc322d6741049ba/FLAG0ad47eb39 [2021-08-26 01:08:25,277 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eecfc3e88/1f511170c3874db68bc322d6741049ba [2021-08-26 01:08:25,282 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-26 01:08:25,285 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-26 01:08:25,287 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-26 01:08:25,287 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-26 01:08:25,290 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-26 01:08:25,291 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 01:08:25" (1/1) ... [2021-08-26 01:08:25,291 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ab66d4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:08:25, skipping insertion in model container [2021-08-26 01:08:25,292 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 01:08:25" (1/1) ... [2021-08-26 01:08:25,296 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-26 01:08:25,304 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-26 01:08:25,411 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-esbmc-regression/Double_div.i[804,817] [2021-08-26 01:08:25,421 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-26 01:08:25,435 INFO L203 MainTranslator]: Completed pre-run [2021-08-26 01:08:25,445 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-esbmc-regression/Double_div.i[804,817] [2021-08-26 01:08:25,477 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-26 01:08:25,492 INFO L208 MainTranslator]: Completed translation [2021-08-26 01:08:25,493 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:08:25 WrapperNode [2021-08-26 01:08:25,493 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-26 01:08:25,494 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-26 01:08:25,494 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-26 01:08:25,494 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-26 01:08:25,498 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:08:25" (1/1) ... [2021-08-26 01:08:25,502 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:08:25" (1/1) ... [2021-08-26 01:08:25,511 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-26 01:08:25,514 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-26 01:08:25,514 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-26 01:08:25,514 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-26 01:08:25,518 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:08:25" (1/1) ... [2021-08-26 01:08:25,519 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:08:25" (1/1) ... [2021-08-26 01:08:25,520 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:08:25" (1/1) ... [2021-08-26 01:08:25,520 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:08:25" (1/1) ... [2021-08-26 01:08:25,523 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:08:25" (1/1) ... [2021-08-26 01:08:25,525 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:08:25" (1/1) ... [2021-08-26 01:08:25,526 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:08:25" (1/1) ... [2021-08-26 01:08:25,527 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-26 01:08:25,528 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-26 01:08:25,528 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-26 01:08:25,528 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-26 01:08:25,528 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:08:25" (1/1) ... [2021-08-26 01:08:25,532 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-26 01:08:25,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 01:08:25,544 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) [2021-08-26 01:08:25,560 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 [2021-08-26 01:08:25,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-08-26 01:08:25,570 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-26 01:08:25,570 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-26 01:08:25,571 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-26 01:08:28,448 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-26 01:08:28,449 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-08-26 01:08:28,450 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 01:08:28 BoogieIcfgContainer [2021-08-26 01:08:28,450 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-26 01:08:28,451 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-26 01:08:28,451 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-26 01:08:28,453 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-26 01:08:28,453 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 01:08:25" (1/3) ... [2021-08-26 01:08:28,453 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@531b8613 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 01:08:28, skipping insertion in model container [2021-08-26 01:08:28,454 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:08:25" (2/3) ... [2021-08-26 01:08:28,454 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@531b8613 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 01:08:28, skipping insertion in model container [2021-08-26 01:08:28,454 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 01:08:28" (3/3) ... [2021-08-26 01:08:28,455 INFO L111 eAbstractionObserver]: Analyzing ICFG Double_div.i [2021-08-26 01:08:28,458 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-26 01:08:28,458 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-08-26 01:08:28,497 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-26 01:08:28,501 INFO L339 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, mConcurrency=FINITE_AUTOMATA, 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, mLoopAccelerationTechnique=FAST_UPR [2021-08-26 01:08:28,501 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-08-26 01:08:28,509 INFO L276 IsEmpty]: Start isEmpty. Operand has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:08:28,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-08-26 01:08:28,511 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 01:08:28,511 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-08-26 01:08:28,512 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 01:08:28,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 01:08:28,515 INFO L82 PathProgramCache]: Analyzing trace with hash 889633835, now seen corresponding path program 1 times [2021-08-26 01:08:28,522 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-26 01:08:28,522 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1782670458] [2021-08-26 01:08:28,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 01:08:28,522 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-26 01:08:28,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-26 01:08:28,532 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) [2021-08-26 01:08:28,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-08-26 01:08:28,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 01:08:28,700 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-26 01:08:28,703 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 01:08:34,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 01:08:34,591 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-26 01:08:36,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 01:08:36,137 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-26 01:08:36,137 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1782670458] [2021-08-26 01:08:36,138 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1782670458] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-26 01:08:36,138 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-26 01:08:36,138 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2021-08-26 01:08:36,139 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640464070] [2021-08-26 01:08:36,142 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-26 01:08:36,142 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-26 01:08:36,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-26 01:08:36,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-08-26 01:08:36,156 INFO L87 Difference]: Start difference. First operand has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:08:46,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 01:08:46,466 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2021-08-26 01:08:46,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-26 01:08:46,468 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-08-26 01:08:46,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 01:08:46,472 INFO L225 Difference]: With dead ends: 21 [2021-08-26 01:08:46,472 INFO L226 Difference]: Without dead ends: 9 [2021-08-26 01:08:46,474 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 8546.1ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-08-26 01:08:46,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2021-08-26 01:08:46,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2021-08-26 01:08:46,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:08:46,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2021-08-26 01:08:46,506 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2021-08-26 01:08:46,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 01:08:46,507 INFO L470 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2021-08-26 01:08:46,507 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:08:46,507 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2021-08-26 01:08:46,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-08-26 01:08:46,507 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 01:08:46,508 INFO L512 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2021-08-26 01:08:46,519 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2021-08-26 01:08:46,719 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-26 01:08:46,720 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 01:08:46,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 01:08:46,723 INFO L82 PathProgramCache]: Analyzing trace with hash 292915403, now seen corresponding path program 1 times [2021-08-26 01:08:46,726 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-26 01:08:46,726 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1168304481] [2021-08-26 01:08:46,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 01:08:46,726 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-26 01:08:46,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-26 01:08:46,727 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) [2021-08-26 01:08:46,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-08-26 01:08:47,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 01:08:47,226 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 8 conjunts are in the unsatisfiable core [2021-08-26 01:08:47,227 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 01:09:04,178 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 01:09:04,178 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-26 01:09:11,050 WARN L838 $PredicateComparison]: unable to prove that (not (fp.eq (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0))) c_ULTIMATE.start_main_~x1~0)) is different from false [2021-08-26 01:09:13,167 WARN L860 $PredicateComparison]: unable to prove that (not (fp.eq (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0))) c_ULTIMATE.start_main_~x1~0)) is different from true [2021-08-26 01:09:19,654 WARN L838 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x1~0 .cse1))) (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)))) is different from false [2021-08-26 01:09:21,885 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x1~0 .cse1))) (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)))) is different from true [2021-08-26 01:09:28,573 WARN L838 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse1) .cse1))) (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)))) is different from false [2021-08-26 01:09:30,803 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse1) .cse1))) (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)))) is different from true [2021-08-26 01:09:30,803 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2021-08-26 01:09:30,803 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-26 01:09:30,803 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1168304481] [2021-08-26 01:09:30,804 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1168304481] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-26 01:09:30,804 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 01:09:30,804 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2021-08-26 01:09:30,804 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562899934] [2021-08-26 01:09:30,805 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-26 01:09:30,805 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-26 01:09:30,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-26 01:09:30,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=26, Unknown=8, NotChecked=36, Total=90 [2021-08-26 01:09:30,806 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:09:33,069 WARN L860 $PredicateComparison]: unable to prove that (and (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse1) .cse1))) (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-08-26 01:09:46,215 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (not (fp.eq c_ULTIMATE.start_main_~x1~0 c_ULTIMATE.start_main_~x~0)) (not (fp.eq (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x1~0 .cse0) c_ULTIMATE.start_main_~x1~0)) (= c_ULTIMATE.start_main_~x1~0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0) .cse0)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2021-08-26 01:09:55,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 01:09:55,305 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2021-08-26 01:09:55,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-26 01:09:55,306 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-08-26 01:09:55,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 01:09:55,306 INFO L225 Difference]: With dead ends: 15 [2021-08-26 01:09:55,306 INFO L226 Difference]: Without dead ends: 11 [2021-08-26 01:09:55,307 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 41149.2ms TimeCoverageRelationStatistics Valid=28, Invalid=35, Unknown=13, NotChecked=80, Total=156 [2021-08-26 01:09:55,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2021-08-26 01:09:55,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2021-08-26 01:09:55,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:09:55,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2021-08-26 01:09:55,308 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8 [2021-08-26 01:09:55,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 01:09:55,309 INFO L470 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2021-08-26 01:09:55,309 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:09:55,309 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2021-08-26 01:09:55,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-08-26 01:09:55,309 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 01:09:55,309 INFO L512 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2021-08-26 01:09:55,327 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-08-26 01:09:55,509 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-26 01:09:55,510 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 01:09:55,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 01:09:55,510 INFO L82 PathProgramCache]: Analyzing trace with hash -1922847381, now seen corresponding path program 2 times [2021-08-26 01:09:55,511 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-26 01:09:55,511 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [305825303] [2021-08-26 01:09:55,511 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-26 01:09:55,511 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-26 01:09:55,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-26 01:09:55,512 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) [2021-08-26 01:09:55,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-08-26 01:09:56,154 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-26 01:09:56,155 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-26 01:09:56,189 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 15 conjunts are in the unsatisfiable core [2021-08-26 01:09:56,190 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 01:10:00,360 WARN L860 $PredicateComparison]: unable to prove that (and (= c_ULTIMATE.start_main_~x1~0 (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-08-26 01:10:08,260 WARN L860 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (= c_ULTIMATE.start_main_~x1~0 (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0)))) is different from true [2021-08-26 01:10:13,662 WARN L207 SmtUtils]: Spent 5.36 s on a formula simplification that was a NOOP. DAG size: 3 [2021-08-26 01:10:16,677 WARN L860 $PredicateComparison]: unable to prove that (and (= c_ULTIMATE.start_main_~x1~0 (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-08-26 01:10:25,359 WARN L207 SmtUtils]: Spent 5.93 s on a formula simplification that was a NOOP. DAG size: 3 [2021-08-26 01:10:28,044 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (= c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0) .cse0)) (= (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 .cse0) c_ULTIMATE.start_main_~x1~0) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2021-08-26 01:10:28,108 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2021-08-26 01:10:28,108 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-26 01:10:37,484 WARN L838 $PredicateComparison]: unable to prove that (or (not (fp.eq (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0))) c_ULTIMATE.start_main_~x1~0)) (fp.eq c_ULTIMATE.start_main_~x1~0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) is different from false [2021-08-26 01:10:39,600 WARN L860 $PredicateComparison]: unable to prove that (or (not (fp.eq (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0))) c_ULTIMATE.start_main_~x1~0)) (fp.eq c_ULTIMATE.start_main_~x1~0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) is different from true [2021-08-26 01:10:51,420 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x1~0 .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))))) is different from false [2021-08-26 01:10:53,658 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x1~0 .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))))) is different from true [2021-08-26 01:10:58,792 WARN L207 SmtUtils]: Spent 5.13 s on a formula simplification that was a NOOP. DAG size: 9 [2021-08-26 01:11:04,143 WARN L207 SmtUtils]: Spent 5.35 s on a formula simplification that was a NOOP. DAG size: 9 [2021-08-26 01:11:06,500 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x1~0 .cse1) .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))))) is different from false [2021-08-26 01:11:08,851 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x1~0 .cse1) .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))))) is different from true [2021-08-26 01:11:14,427 WARN L207 SmtUtils]: Spent 5.57 s on a formula simplification that was a NOOP. DAG size: 10 [2021-08-26 01:11:20,224 WARN L207 SmtUtils]: Spent 5.80 s on a formula simplification that was a NOOP. DAG size: 10 [2021-08-26 01:11:22,703 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x1~0 .cse1) .cse1) .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))))) is different from false [2021-08-26 01:11:25,183 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x1~0 .cse1) .cse1) .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))))) is different from true [2021-08-26 01:11:30,866 WARN L207 SmtUtils]: Spent 5.67 s on a formula simplification that was a NOOP. DAG size: 12 [2021-08-26 01:11:36,777 WARN L207 SmtUtils]: Spent 5.89 s on a formula simplification that was a NOOP. DAG size: 12 [2021-08-26 01:11:39,288 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse1) .cse1) .cse1) .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))))) is different from false [2021-08-26 01:11:41,812 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse1) .cse1) .cse1) .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))))) is different from true [2021-08-26 01:11:41,813 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2021-08-26 01:11:41,813 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-26 01:11:41,813 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [305825303] [2021-08-26 01:11:41,813 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [305825303] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-26 01:11:41,813 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 01:11:41,813 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 15 [2021-08-26 01:11:41,814 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410076690] [2021-08-26 01:11:41,814 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-08-26 01:11:41,814 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-26 01:11:41,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-08-26 01:11:41,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=33, Unknown=14, NotChecked=162, Total=240 [2021-08-26 01:11:41,815 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:11:44,383 WARN L860 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse1) .cse1) .cse1) .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))))))) is different from true [2021-08-26 01:11:46,916 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (= (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0) c_ULTIMATE.start_main_~x1~0) (let ((.cse1 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x1~0 .cse0) .cse0) .cse0))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse1 .cse0) .cse1)) (fp.eq .cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2021-08-26 01:11:49,310 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x1~0 .cse1) .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))))) (= c_ULTIMATE.start_main_~x1~0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse1) .cse1)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2021-08-26 01:11:51,581 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (= c_currentRoundingMode roundNearestTiesToEven) (= c_ULTIMATE.start_main_~x1~0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0)) (let ((.cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x1~0 .cse0))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse1 .cse0) .cse1)) (fp.eq .cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))))))) is different from true [2021-08-26 01:11:54,545 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (= c_ULTIMATE.start_main_~x1~0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0) .cse0)) (or (not (fp.eq (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x1~0 .cse0) c_ULTIMATE.start_main_~x1~0)) (fp.eq c_ULTIMATE.start_main_~x1~0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2021-08-26 01:11:57,286 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (or (not (fp.eq c_ULTIMATE.start_main_~x1~0 c_ULTIMATE.start_main_~x~0)) (fp.eq c_ULTIMATE.start_main_~x~0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (= c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0) .cse0)) (= (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 .cse0) c_ULTIMATE.start_main_~x1~0) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2021-08-26 01:12:00,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 01:12:00,273 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2021-08-26 01:12:00,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-26 01:12:00,274 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-08-26 01:12:00,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 01:12:00,274 INFO L225 Difference]: With dead ends: 16 [2021-08-26 01:12:00,274 INFO L226 Difference]: Without dead ends: 12 [2021-08-26 01:12:00,275 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 50034.8ms TimeCoverageRelationStatistics Valid=43, Invalid=39, Unknown=20, NotChecked=360, Total=462 [2021-08-26 01:12:00,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2021-08-26 01:12:00,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2021-08-26 01:12:00,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:12:00,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2021-08-26 01:12:00,276 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2021-08-26 01:12:00,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 01:12:00,276 INFO L470 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2021-08-26 01:12:00,277 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:12:00,277 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2021-08-26 01:12:00,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-08-26 01:12:00,277 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 01:12:00,277 INFO L512 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1] [2021-08-26 01:12:00,311 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-08-26 01:12:00,477 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-26 01:12:00,478 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 01:12:00,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 01:12:00,478 INFO L82 PathProgramCache]: Analyzing trace with hash 522938704, now seen corresponding path program 3 times [2021-08-26 01:12:00,478 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-26 01:12:00,478 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1252824131] [2021-08-26 01:12:00,478 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-08-26 01:12:00,479 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-26 01:12:00,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-26 01:12:00,481 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) [2021-08-26 01:12:00,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-08-26 01:12:01,230 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-08-26 01:12:01,231 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-26 01:12:01,267 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 9 conjunts are in the unsatisfiable core [2021-08-26 01:12:01,268 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 01:12:09,813 WARN L860 $PredicateComparison]: unable to prove that (and (= (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0))) c_ULTIMATE.start_main_~x1~0) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-08-26 01:12:28,339 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((v_ULTIMATE.start_main_~x~0_17 (_ FloatingPoint 11 53))) (and (= c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~x~0_17 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (not (fp.eq c_ULTIMATE.start_main_~x~0 v_ULTIMATE.start_main_~x~0_17)))) (= (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0))) c_ULTIMATE.start_main_~x1~0) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-08-26 01:12:30,437 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ULTIMATE.start_main_~x~0_17 (_ FloatingPoint 11 53))) (and (= c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~x~0_17 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (not (fp.eq c_ULTIMATE.start_main_~x~0 v_ULTIMATE.start_main_~x~0_17)))) (= (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0))) c_ULTIMATE.start_main_~x1~0) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-08-26 01:12:49,521 WARN L838 $PredicateComparison]: unable to prove that (and (fp.eq (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0))) c_ULTIMATE.start_main_~x~0) (exists ((v_ULTIMATE.start_main_~x~0_17 (_ FloatingPoint 11 53))) (and (= c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~x~0_17 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (not (fp.eq c_ULTIMATE.start_main_~x~0 v_ULTIMATE.start_main_~x~0_17)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-08-26 01:12:51,640 WARN L860 $PredicateComparison]: unable to prove that (and (fp.eq (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0))) c_ULTIMATE.start_main_~x~0) (exists ((v_ULTIMATE.start_main_~x~0_17 (_ FloatingPoint 11 53))) (and (= c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~x~0_17 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (not (fp.eq c_ULTIMATE.start_main_~x~0 v_ULTIMATE.start_main_~x~0_17)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-08-26 01:13:51,806 WARN L838 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~x~0_17 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven v_ULTIMATE.start_main_~x~0_17 .cse1))) (and (not (fp.eq .cse0 v_ULTIMATE.start_main_~x~0_17)) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0) (let ((.cse2 (fp.eq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))))) (or (and (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)) (not .cse2)) (and (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv1 32)) .cse2))))))) is different from false [2021-08-26 01:13:53,980 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~x~0_17 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven v_ULTIMATE.start_main_~x~0_17 .cse1))) (and (not (fp.eq .cse0 v_ULTIMATE.start_main_~x~0_17)) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0) (let ((.cse2 (fp.eq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))))) (or (and (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)) (not .cse2)) (and (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv1 32)) .cse2))))))) is different from true [2021-08-26 01:14:13,177 WARN L838 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~x~0_17 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven v_ULTIMATE.start_main_~x~0_17 .cse1))) (and (not (fp.eq .cse0 v_ULTIMATE.start_main_~x~0_17)) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0) (not (fp.eq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))))))) is different from false [2021-08-26 01:14:15,366 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~x~0_17 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven v_ULTIMATE.start_main_~x~0_17 .cse1))) (and (not (fp.eq .cse0 v_ULTIMATE.start_main_~x~0_17)) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0) (not (fp.eq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))))))) is different from true [2021-08-26 01:14:15,366 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 9 not checked. [2021-08-26 01:14:15,366 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-26 01:14:29,356 WARN L838 $PredicateComparison]: unable to prove that (or (fp.eq c_ULTIMATE.start_main_~x1~0 c_ULTIMATE.start_main_~x~0) (not (fp.eq (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0))) c_ULTIMATE.start_main_~x1~0)) (fp.eq c_ULTIMATE.start_main_~x1~0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) is different from false [2021-08-26 01:14:31,483 WARN L860 $PredicateComparison]: unable to prove that (or (fp.eq c_ULTIMATE.start_main_~x1~0 c_ULTIMATE.start_main_~x~0) (not (fp.eq (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0))) c_ULTIMATE.start_main_~x1~0)) (fp.eq c_ULTIMATE.start_main_~x1~0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) is different from true [2021-08-26 01:14:47,070 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~x~0_19 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~x~0_19 .cse1))) (or (fp.eq .cse0 v_ULTIMATE.start_main_~x~0_19) (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)))))) is different from false [2021-08-26 01:14:49,310 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~x~0_19 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~x~0_19 .cse1))) (or (fp.eq .cse0 v_ULTIMATE.start_main_~x~0_19) (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)))))) is different from true [2021-08-26 01:15:47,444 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 9 not checked. [2021-08-26 01:15:47,445 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-26 01:15:47,445 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1252824131] [2021-08-26 01:15:47,445 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1252824131] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-26 01:15:47,445 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 01:15:47,445 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2021-08-26 01:15:47,445 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168246535] [2021-08-26 01:15:47,445 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-08-26 01:15:47,445 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-26 01:15:47,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-26 01:15:47,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=21, Unknown=13, NotChecked=98, Total=156 [2021-08-26 01:15:47,446 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:15:49,651 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_main_~x~0_19 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~x~0_19 .cse1))) (or (fp.eq .cse0 v_ULTIMATE.start_main_~x~0_19) (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-08-26 01:15:51,905 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_main_~x~0_19 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~x~0_19 .cse1))) (or (fp.eq .cse0 v_ULTIMATE.start_main_~x~0_19) (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-08-26 01:15:54,273 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (forall ((v_ULTIMATE.start_main_~x~0_19 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~x~0_19 .cse1))) (or (fp.eq .cse0 v_ULTIMATE.start_main_~x~0_19) (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)))))) (= (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 .cse2) c_ULTIMATE.start_main_~x1~0) (or (fp.eq c_ULTIMATE.start_main_~x1~0 c_ULTIMATE.start_main_~x~0) (not (fp.eq (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x1~0 .cse2) c_ULTIMATE.start_main_~x1~0)) (fp.eq c_ULTIMATE.start_main_~x1~0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2021-08-26 01:15:56,773 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (forall ((v_ULTIMATE.start_main_~x~0_19 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~x~0_19 .cse1))) (or (fp.eq .cse0 v_ULTIMATE.start_main_~x~0_19) (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)))))) (= (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 .cse2) c_ULTIMATE.start_main_~x1~0) (or (fp.eq c_ULTIMATE.start_main_~x1~0 c_ULTIMATE.start_main_~x~0) (not (fp.eq (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x1~0 .cse2) c_ULTIMATE.start_main_~x1~0)) (fp.eq c_ULTIMATE.start_main_~x1~0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2021-08-26 01:15:59,348 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.eq c_ULTIMATE.start_main_~x1~0 c_ULTIMATE.start_main_~x~0)) (.cse4 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0))) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (and (forall ((v_ULTIMATE.start_main_~x~0_19 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~x~0_19 .cse1))) (or (fp.eq .cse0 v_ULTIMATE.start_main_~x~0_19) (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)))))) (or (not .cse2) (fp.eq c_ULTIMATE.start_main_~x~0 .cse3)) (exists ((v_ULTIMATE.start_main_~x~0_17 (_ FloatingPoint 11 53))) (and (= c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~x~0_17 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (not (fp.eq c_ULTIMATE.start_main_~x~0 v_ULTIMATE.start_main_~x~0_17)))) (= (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 .cse4) c_ULTIMATE.start_main_~x1~0) (or .cse2 (not (fp.eq (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x1~0 .cse4) c_ULTIMATE.start_main_~x1~0)) (fp.eq c_ULTIMATE.start_main_~x1~0 .cse3)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2021-08-26 01:16:01,713 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.eq c_ULTIMATE.start_main_~x1~0 c_ULTIMATE.start_main_~x~0)) (.cse4 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0))) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (and (forall ((v_ULTIMATE.start_main_~x~0_19 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~x~0_19 .cse1))) (or (fp.eq .cse0 v_ULTIMATE.start_main_~x~0_19) (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)))))) (or (not .cse2) (fp.eq c_ULTIMATE.start_main_~x~0 .cse3)) (exists ((v_ULTIMATE.start_main_~x~0_17 (_ FloatingPoint 11 53))) (and (= c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~x~0_17 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (not (fp.eq c_ULTIMATE.start_main_~x~0 v_ULTIMATE.start_main_~x~0_17)))) (= (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 .cse4) c_ULTIMATE.start_main_~x1~0) (or .cse2 (not (fp.eq (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x1~0 .cse4) c_ULTIMATE.start_main_~x1~0)) (fp.eq c_ULTIMATE.start_main_~x1~0 .cse3)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2021-08-26 01:16:03,960 WARN L838 $PredicateComparison]: unable to prove that (and (fp.eq (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0))) c_ULTIMATE.start_main_~x~0) (fp.eq c_ULTIMATE.start_main_~x~0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (exists ((v_ULTIMATE.start_main_~x~0_17 (_ FloatingPoint 11 53))) (and (= c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~x~0_17 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (not (fp.eq c_ULTIMATE.start_main_~x~0 v_ULTIMATE.start_main_~x~0_17)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-08-26 01:16:06,084 WARN L860 $PredicateComparison]: unable to prove that (and (fp.eq (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0))) c_ULTIMATE.start_main_~x~0) (fp.eq c_ULTIMATE.start_main_~x~0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (exists ((v_ULTIMATE.start_main_~x~0_17 (_ FloatingPoint 11 53))) (and (= c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~x~0_17 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (not (fp.eq c_ULTIMATE.start_main_~x~0 v_ULTIMATE.start_main_~x~0_17)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-08-26 01:16:08,339 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((v_ULTIMATE.start_main_~x~0_17 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven v_ULTIMATE.start_main_~x~0_17 .cse1))) (and (not (fp.eq .cse0 v_ULTIMATE.start_main_~x~0_17)) (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0) (let ((.cse2 (fp.eq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))))) (or (and (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)) (not .cse2)) (and (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv1 32)) .cse2))))))) (not (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))) is different from false [2021-08-26 01:16:08,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 01:16:08,360 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2021-08-26 01:16:08,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-26 01:16:08,360 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-08-26 01:16:08,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 01:16:08,361 INFO L225 Difference]: With dead ends: 12 [2021-08-26 01:16:08,361 INFO L226 Difference]: Without dead ends: 0 [2021-08-26 01:16:08,361 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 50247.3ms TimeCoverageRelationStatistics Valid=34, Invalid=22, Unknown=22, NotChecked=228, Total=306 [2021-08-26 01:16:08,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-08-26 01:16:08,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-08-26 01:16:08,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:16:08,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-08-26 01:16:08,361 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 11 [2021-08-26 01:16:08,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 01:16:08,361 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-26 01:16:08,361 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:16:08,361 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-08-26 01:16:08,362 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-08-26 01:16:08,363 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 01:16:08,393 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-08-26 01:16:08,578 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-26 01:16:08,580 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-08-26 01:16:08,583 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 01:16:08,607 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 01:16:08,640 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 01:16:59,009 WARN L224 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2021-08-26 01:16:59,010 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:239) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:258) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:61) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.getRedundancy(SimplifyDDA.java:621) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.simplify.SimplifyDDAWithTimeout.getRedundancy(SimplifyDDAWithTimeout.java:120) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA$Simplifier.walk(SimplifyDDA.java:371) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.simplifyOnce(SimplifyDDA.java:650) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.simplify.SimplifyDDAWithTimeout.getSimplifiedTerm(SimplifyDDAWithTimeout.java:180) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:174) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:239) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter(HoareAnnotationComposer.java:149) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.(HoareAnnotationComposer.java:105) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeIcfgHoareAnnotation(BasicCegarLoop.java:1177) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop$CegarLoopResultBuilder.getResult(AbstractCegarLoop.java:831) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:350) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:53) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:392) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1461) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:654) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:235) ... 39 more [2021-08-26 01:16:59,011 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 101 [2021-08-26 01:16:59,014 INFO L168 Benchmark]: Toolchain (without parser) took 513728.81 ms. Allocated memory was 58.7 MB in the beginning and 83.9 MB in the end (delta: 25.2 MB). Free memory was 37.4 MB in the beginning and 59.1 MB in the end (delta: -21.7 MB). Peak memory consumption was 36.7 MB. Max. memory is 16.1 GB. [2021-08-26 01:16:59,015 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 58.7 MB. Free memory was 40.8 MB in the beginning and 40.7 MB in the end (delta: 39.0 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-26 01:16:59,015 INFO L168 Benchmark]: CACSL2BoogieTranslator took 206.08 ms. Allocated memory is still 58.7 MB. Free memory was 37.3 MB in the beginning and 42.0 MB in the end (delta: -4.7 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-08-26 01:16:59,016 INFO L168 Benchmark]: Boogie Procedure Inliner took 20.09 ms. Allocated memory is still 58.7 MB. Free memory was 42.0 MB in the beginning and 40.6 MB in the end (delta: 1.4 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-26 01:16:59,016 INFO L168 Benchmark]: Boogie Preprocessor took 13.09 ms. Allocated memory is still 58.7 MB. Free memory was 40.6 MB in the beginning and 39.5 MB in the end (delta: 1.1 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-26 01:16:59,016 INFO L168 Benchmark]: RCFGBuilder took 2922.37 ms. Allocated memory is still 58.7 MB. Free memory was 39.3 MB in the beginning and 28.3 MB in the end (delta: 11.0 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-08-26 01:16:59,016 INFO L168 Benchmark]: TraceAbstraction took 510561.94 ms. Allocated memory was 58.7 MB in the beginning and 83.9 MB in the end (delta: 25.2 MB). Free memory was 28.0 MB in the beginning and 59.1 MB in the end (delta: -31.1 MB). Peak memory consumption was 29.3 MB. Max. memory is 16.1 GB. [2021-08-26 01:16:59,018 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.14 ms. Allocated memory is still 58.7 MB. Free memory was 40.8 MB in the beginning and 40.7 MB in the end (delta: 39.0 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 206.08 ms. Allocated memory is still 58.7 MB. Free memory was 37.3 MB in the beginning and 42.0 MB in the end (delta: -4.7 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 20.09 ms. Allocated memory is still 58.7 MB. Free memory was 42.0 MB in the beginning and 40.6 MB in the end (delta: 1.4 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 13.09 ms. Allocated memory is still 58.7 MB. Free memory was 40.6 MB in the beginning and 39.5 MB in the end (delta: 1.1 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 2922.37 ms. Allocated memory is still 58.7 MB. Free memory was 39.3 MB in the beginning and 28.3 MB in the end (delta: 11.0 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * TraceAbstraction took 510561.94 ms. Allocated memory was 58.7 MB in the beginning and 83.9 MB in the end (delta: 25.2 MB). Free memory was 28.0 MB in the beginning and 59.1 MB in the end (delta: -31.1 MB). Peak memory consumption was 29.3 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:239) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...