./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/float-newlib/double_req_bl_1230.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2880296f 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 ../../../trunk/examples/svcomp/float-newlib/double_req_bl_1230.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 858612fdb9071600e83746a6e504d4acbbe533c1 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 ../../../trunk/examples/svcomp/float-newlib/double_req_bl_1230.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 858612fdb9071600e83746a6e504d4acbbe533c1 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") --- Real Ultimate output --- This is Ultimate 0.2.0-2880296 [2020-12-02 15:34:31,154 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-02 15:34:31,159 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-02 15:34:31,222 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-02 15:34:31,222 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-02 15:34:31,228 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-02 15:34:31,233 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-02 15:34:31,240 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-02 15:34:31,249 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-02 15:34:31,258 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-02 15:34:31,260 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-02 15:34:31,262 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-02 15:34:31,263 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-02 15:34:31,265 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-02 15:34:31,269 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-02 15:34:31,272 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-02 15:34:31,273 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-02 15:34:31,278 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-02 15:34:31,283 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-02 15:34:31,291 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-02 15:34:31,295 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-02 15:34:31,298 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-02 15:34:31,300 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-02 15:34:31,303 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-02 15:34:31,314 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-02 15:34:31,314 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-02 15:34:31,314 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-02 15:34:31,316 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-02 15:34:31,317 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-02 15:34:31,318 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-02 15:34:31,319 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-02 15:34:31,320 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-02 15:34:31,321 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-02 15:34:31,323 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-02 15:34:31,324 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-02 15:34:31,324 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-02 15:34:31,325 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-02 15:34:31,326 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-02 15:34:31,326 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-02 15:34:31,327 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-02 15:34:31,328 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-02 15:34:31,329 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-12-02 15:34:31,366 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-02 15:34:31,366 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-02 15:34:31,370 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-02 15:34:31,372 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-02 15:34:31,372 INFO L138 SettingsManager]: * Use SBE=true [2020-12-02 15:34:31,372 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-02 15:34:31,373 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-02 15:34:31,373 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-02 15:34:31,373 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-02 15:34:31,373 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-02 15:34:31,375 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-02 15:34:31,376 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-02 15:34:31,376 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-02 15:34:31,376 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-02 15:34:31,377 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-02 15:34:31,377 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-02 15:34:31,377 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-02 15:34:31,377 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-02 15:34:31,378 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-02 15:34:31,378 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-12-02 15:34:31,379 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-02 15:34:31,379 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-02 15:34:31,379 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-02 15:34:31,380 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-02 15:34:31,380 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-02 15:34:31,380 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-02 15:34:31,381 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-02 15:34:31,381 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-02 15:34:31,382 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-02 15:34:31,382 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 -> 858612fdb9071600e83746a6e504d4acbbe533c1 [2020-12-02 15:34:31,853 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-02 15:34:31,895 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-02 15:34:31,900 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-02 15:34:31,902 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-02 15:34:31,904 INFO L275 PluginConnector]: CDTParser initialized [2020-12-02 15:34:31,906 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/double_req_bl_1230.c [2020-12-02 15:34:32,031 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4714952c/960b3dacf35b40939d5988c79390c7ea/FLAG6de1daa6e [2020-12-02 15:34:32,706 INFO L306 CDTParser]: Found 1 translation units. [2020-12-02 15:34:32,707 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/double_req_bl_1230.c [2020-12-02 15:34:32,716 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4714952c/960b3dacf35b40939d5988c79390c7ea/FLAG6de1daa6e [2020-12-02 15:34:33,047 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4714952c/960b3dacf35b40939d5988c79390c7ea [2020-12-02 15:34:33,053 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-02 15:34:33,056 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-02 15:34:33,057 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-02 15:34:33,058 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-02 15:34:33,062 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-02 15:34:33,063 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:34:33" (1/1) ... [2020-12-02 15:34:33,068 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d1fde31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:34:33, skipping insertion in model container [2020-12-02 15:34:33,068 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:34:33" (1/1) ... [2020-12-02 15:34:33,076 INFO L146 MainTranslator]: Starting translation in SV-COMP mode [2020-12-02 15:34:33,095 INFO L179 MainTranslator]: Built tables and reachable declarations [2020-12-02 15:34:33,316 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/double_req_bl_1230.c[1667,1680] [2020-12-02 15:34:33,320 INFO L211 PostProcessor]: Analyzing one entry point: main [2020-12-02 15:34:33,330 INFO L212 MainTranslator]: Completed pre-run [2020-12-02 15:34:33,356 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/double_req_bl_1230.c[1667,1680] [2020-12-02 15:34:33,357 INFO L211 PostProcessor]: Analyzing one entry point: main [2020-12-02 15:34:33,376 INFO L217 MainTranslator]: Completed translation [2020-12-02 15:34:33,377 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:34:33 WrapperNode [2020-12-02 15:34:33,377 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-02 15:34:33,379 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-02 15:34:33,379 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-02 15:34:33,379 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-02 15:34:33,390 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:34:33" (1/1) ... [2020-12-02 15:34:33,400 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:34:33" (1/1) ... [2020-12-02 15:34:33,428 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-02 15:34:33,429 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-02 15:34:33,429 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-02 15:34:33,430 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-02 15:34:33,440 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:34:33" (1/1) ... [2020-12-02 15:34:33,440 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:34:33" (1/1) ... [2020-12-02 15:34:33,444 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:34:33" (1/1) ... [2020-12-02 15:34:33,444 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:34:33" (1/1) ... [2020-12-02 15:34:33,453 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:34:33" (1/1) ... [2020-12-02 15:34:33,459 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:34:33" (1/1) ... [2020-12-02 15:34:33,465 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:34:33" (1/1) ... [2020-12-02 15:34:33,469 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-02 15:34:33,470 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-02 15:34:33,470 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-02 15:34:33,470 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-02 15:34:33,471 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:34:33" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-02 15:34:33,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-02 15:34:33,577 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-02 15:34:33,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2020-12-02 15:34:33,577 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-02 15:34:33,578 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-02 15:34:33,578 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-12-02 15:34:33,578 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-02 15:34:34,156 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-02 15:34:34,157 INFO L298 CfgBuilder]: Removed 16 assume(true) statements. [2020-12-02 15:34:34,159 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:34:34 BoogieIcfgContainer [2020-12-02 15:34:34,162 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-02 15:34:34,164 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-02 15:34:34,167 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-02 15:34:34,174 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-02 15:34:34,174 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 03:34:33" (1/3) ... [2020-12-02 15:34:34,176 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fff8028 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 03:34:34, skipping insertion in model container [2020-12-02 15:34:34,176 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:34:33" (2/3) ... [2020-12-02 15:34:34,180 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fff8028 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 03:34:34, skipping insertion in model container [2020-12-02 15:34:34,181 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:34:34" (3/3) ... [2020-12-02 15:34:34,183 INFO L111 eAbstractionObserver]: Analyzing ICFG double_req_bl_1230.c [2020-12-02 15:34:34,218 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-02 15:34:34,223 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-02 15:34:34,237 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-02 15:34:34,267 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-02 15:34:34,268 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-02 15:34:34,268 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-02 15:34:34,268 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-02 15:34:34,269 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-02 15:34:34,269 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-02 15:34:34,269 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-02 15:34:34,269 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-02 15:34:34,287 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2020-12-02 15:34:34,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-12-02 15:34:34,305 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 15:34:34,307 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 15:34:34,311 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 15:34:34,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 15:34:34,328 INFO L82 PathProgramCache]: Analyzing trace with hash -958093107, now seen corresponding path program 1 times [2020-12-02 15:34:34,345 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 15:34:34,347 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182452913] [2020-12-02 15:34:34,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 15:34:34,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 15:34:34,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 15:34:34,552 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182452913] [2020-12-02 15:34:34,552 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 15:34:34,553 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-02 15:34:34,554 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773860518] [2020-12-02 15:34:34,559 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-12-02 15:34:34,559 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 15:34:34,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-12-02 15:34:34,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-02 15:34:34,579 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 2 states. [2020-12-02 15:34:34,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 15:34:34,602 INFO L93 Difference]: Finished difference Result 54 states and 84 transitions. [2020-12-02 15:34:34,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-12-02 15:34:34,603 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2020-12-02 15:34:34,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 15:34:34,615 INFO L225 Difference]: With dead ends: 54 [2020-12-02 15:34:34,615 INFO L226 Difference]: Without dead ends: 25 [2020-12-02 15:34:34,618 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-02 15:34:34,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-12-02 15:34:34,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2020-12-02 15:34:34,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-12-02 15:34:34,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 35 transitions. [2020-12-02 15:34:34,658 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 35 transitions. Word has length 10 [2020-12-02 15:34:34,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 15:34:34,659 INFO L481 AbstractCegarLoop]: Abstraction has 25 states and 35 transitions. [2020-12-02 15:34:34,659 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-12-02 15:34:34,659 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 35 transitions. [2020-12-02 15:34:34,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-12-02 15:34:34,660 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 15:34:34,660 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 15:34:34,660 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-02 15:34:34,661 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 15:34:34,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 15:34:34,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1001566992, now seen corresponding path program 1 times [2020-12-02 15:34:34,662 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 15:34:34,662 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044397715] [2020-12-02 15:34:34,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 15:34:34,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 15:34:34,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 15:34:34,795 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044397715] [2020-12-02 15:34:34,796 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 15:34:34,796 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-02 15:34:34,796 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097613966] [2020-12-02 15:34:34,799 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-02 15:34:34,799 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 15:34:34,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-02 15:34:34,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-02 15:34:34,804 INFO L87 Difference]: Start difference. First operand 25 states and 35 transitions. Second operand 4 states. [2020-12-02 15:34:34,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 15:34:34,886 INFO L93 Difference]: Finished difference Result 41 states and 52 transitions. [2020-12-02 15:34:34,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-02 15:34:34,888 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-12-02 15:34:34,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 15:34:34,889 INFO L225 Difference]: With dead ends: 41 [2020-12-02 15:34:34,889 INFO L226 Difference]: Without dead ends: 36 [2020-12-02 15:34:34,891 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-02 15:34:34,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-12-02 15:34:34,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 27. [2020-12-02 15:34:34,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-12-02 15:34:34,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2020-12-02 15:34:34,899 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 37 transitions. Word has length 11 [2020-12-02 15:34:34,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 15:34:34,900 INFO L481 AbstractCegarLoop]: Abstraction has 27 states and 37 transitions. [2020-12-02 15:34:34,900 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-02 15:34:34,900 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2020-12-02 15:34:34,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-12-02 15:34:34,901 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 15:34:34,901 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 15:34:34,901 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-02 15:34:34,902 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 15:34:34,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 15:34:34,903 INFO L82 PathProgramCache]: Analyzing trace with hash 502183504, now seen corresponding path program 1 times [2020-12-02 15:34:34,903 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 15:34:34,903 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261631812] [2020-12-02 15:34:34,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 15:34:34,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 15:34:34,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 15:34:34,960 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261631812] [2020-12-02 15:34:34,961 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 15:34:34,961 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-02 15:34:34,961 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424414416] [2020-12-02 15:34:34,962 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-02 15:34:34,962 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 15:34:34,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-02 15:34:34,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-02 15:34:34,964 INFO L87 Difference]: Start difference. First operand 27 states and 37 transitions. Second operand 4 states. [2020-12-02 15:34:35,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 15:34:35,027 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2020-12-02 15:34:35,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-02 15:34:35,028 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-12-02 15:34:35,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 15:34:35,030 INFO L225 Difference]: With dead ends: 43 [2020-12-02 15:34:35,030 INFO L226 Difference]: Without dead ends: 38 [2020-12-02 15:34:35,031 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-02 15:34:35,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-12-02 15:34:35,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 27. [2020-12-02 15:34:35,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-12-02 15:34:35,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2020-12-02 15:34:35,038 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 37 transitions. Word has length 12 [2020-12-02 15:34:35,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 15:34:35,039 INFO L481 AbstractCegarLoop]: Abstraction has 27 states and 37 transitions. [2020-12-02 15:34:35,039 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-02 15:34:35,039 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2020-12-02 15:34:35,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-02 15:34:35,040 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 15:34:35,040 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 15:34:35,041 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-02 15:34:35,041 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 15:34:35,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 15:34:35,042 INFO L82 PathProgramCache]: Analyzing trace with hash -1951251627, now seen corresponding path program 1 times [2020-12-02 15:34:35,042 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 15:34:35,043 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787489939] [2020-12-02 15:34:35,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 15:34:35,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 15:34:35,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 15:34:35,099 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787489939] [2020-12-02 15:34:35,100 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 15:34:35,100 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-02 15:34:35,100 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811824563] [2020-12-02 15:34:35,101 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-02 15:34:35,101 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 15:34:35,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-02 15:34:35,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-02 15:34:35,103 INFO L87 Difference]: Start difference. First operand 27 states and 37 transitions. Second operand 4 states. [2020-12-02 15:34:35,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 15:34:35,165 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2020-12-02 15:34:35,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-02 15:34:35,166 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-12-02 15:34:35,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 15:34:35,167 INFO L225 Difference]: With dead ends: 45 [2020-12-02 15:34:35,167 INFO L226 Difference]: Without dead ends: 40 [2020-12-02 15:34:35,168 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-02 15:34:35,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-12-02 15:34:35,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 27. [2020-12-02 15:34:35,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-12-02 15:34:35,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2020-12-02 15:34:35,175 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 37 transitions. Word has length 13 [2020-12-02 15:34:35,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 15:34:35,175 INFO L481 AbstractCegarLoop]: Abstraction has 27 states and 37 transitions. [2020-12-02 15:34:35,175 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-02 15:34:35,176 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2020-12-02 15:34:35,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-12-02 15:34:35,176 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 15:34:35,177 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 15:34:35,177 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-02 15:34:35,177 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 15:34:35,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 15:34:35,178 INFO L82 PathProgramCache]: Analyzing trace with hash -555778251, now seen corresponding path program 1 times [2020-12-02 15:34:35,179 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 15:34:35,179 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755475835] [2020-12-02 15:34:35,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 15:34:35,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 15:34:35,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 15:34:35,231 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755475835] [2020-12-02 15:34:35,232 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 15:34:35,232 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-02 15:34:35,232 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949107684] [2020-12-02 15:34:35,233 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-02 15:34:35,233 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 15:34:35,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-02 15:34:35,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-02 15:34:35,235 INFO L87 Difference]: Start difference. First operand 27 states and 37 transitions. Second operand 4 states. [2020-12-02 15:34:35,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 15:34:35,284 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2020-12-02 15:34:35,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-02 15:34:35,285 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-12-02 15:34:35,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 15:34:35,286 INFO L225 Difference]: With dead ends: 43 [2020-12-02 15:34:35,286 INFO L226 Difference]: Without dead ends: 38 [2020-12-02 15:34:35,287 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-02 15:34:35,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-12-02 15:34:35,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 27. [2020-12-02 15:34:35,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-12-02 15:34:35,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2020-12-02 15:34:35,293 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 37 transitions. Word has length 14 [2020-12-02 15:34:35,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 15:34:35,293 INFO L481 AbstractCegarLoop]: Abstraction has 27 states and 37 transitions. [2020-12-02 15:34:35,294 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-02 15:34:35,294 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2020-12-02 15:34:35,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-12-02 15:34:35,295 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 15:34:35,295 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 15:34:35,295 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-02 15:34:35,296 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 15:34:35,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 15:34:35,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1219229111, now seen corresponding path program 1 times [2020-12-02 15:34:35,297 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 15:34:35,297 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91431856] [2020-12-02 15:34:35,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 15:34:35,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-02 15:34:35,336 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-02 15:34:35,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-02 15:34:35,394 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-02 15:34:35,447 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-12-02 15:34:35,447 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-02 15:34:35,447 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-02 15:34:35,481 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 03:34:35 BoogieIcfgContainer [2020-12-02 15:34:35,481 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-02 15:34:35,482 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-02 15:34:35,482 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-02 15:34:35,483 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-02 15:34:35,483 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:34:34" (3/4) ... [2020-12-02 15:34:35,487 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-12-02 15:34:35,487 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-02 15:34:35,490 INFO L168 Benchmark]: Toolchain (without parser) took 2433.50 ms. Allocated memory was 46.1 MB in the beginning and 73.4 MB in the end (delta: 27.3 MB). Free memory was 29.3 MB in the beginning and 44.4 MB in the end (delta: -15.2 MB). Peak memory consumption was 11.5 MB. Max. memory is 16.1 GB. [2020-12-02 15:34:35,491 INFO L168 Benchmark]: CDTParser took 0.32 ms. Allocated memory is still 46.1 MB. Free memory is still 25.9 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-12-02 15:34:35,492 INFO L168 Benchmark]: CACSL2BoogieTranslator took 320.55 ms. Allocated memory was 46.1 MB in the beginning and 60.8 MB in the end (delta: 14.7 MB). Free memory was 29.0 MB in the beginning and 38.1 MB in the end (delta: -9.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-12-02 15:34:35,493 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.61 ms. Allocated memory is still 60.8 MB. Free memory was 38.1 MB in the beginning and 36.3 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-02 15:34:35,494 INFO L168 Benchmark]: Boogie Preprocessor took 39.57 ms. Allocated memory is still 60.8 MB. Free memory was 36.3 MB in the beginning and 34.8 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-02 15:34:35,495 INFO L168 Benchmark]: RCFGBuilder took 692.63 ms. Allocated memory is still 60.8 MB. Free memory was 34.8 MB in the beginning and 28.8 MB in the end (delta: 6.0 MB). Peak memory consumption was 5.8 MB. Max. memory is 16.1 GB. [2020-12-02 15:34:35,497 INFO L168 Benchmark]: TraceAbstraction took 1317.18 ms. Allocated memory was 60.8 MB in the beginning and 73.4 MB in the end (delta: 12.6 MB). Free memory was 28.4 MB in the beginning and 44.9 MB in the end (delta: -16.5 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-02 15:34:35,497 INFO L168 Benchmark]: Witness Printer took 5.42 ms. Allocated memory is still 73.4 MB. Free memory is still 44.4 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-12-02 15:34:35,503 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.32 ms. Allocated memory is still 46.1 MB. Free memory is still 25.9 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 320.55 ms. Allocated memory was 46.1 MB in the beginning and 60.8 MB in the end (delta: 14.7 MB). Free memory was 29.0 MB in the beginning and 38.1 MB in the end (delta: -9.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 49.61 ms. Allocated memory is still 60.8 MB. Free memory was 38.1 MB in the beginning and 36.3 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 39.57 ms. Allocated memory is still 60.8 MB. Free memory was 36.3 MB in the beginning and 34.8 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 692.63 ms. Allocated memory is still 60.8 MB. Free memory was 34.8 MB in the beginning and 28.8 MB in the end (delta: 6.0 MB). Peak memory consumption was 5.8 MB. Max. memory is 16.1 GB. * TraceAbstraction took 1317.18 ms. Allocated memory was 60.8 MB in the beginning and 73.4 MB in the end (delta: 12.6 MB). Free memory was 28.4 MB in the beginning and 44.9 MB in the end (delta: -16.5 MB). There was no memory consumed. Max. memory is 16.1 GB. * Witness Printer took 5.42 ms. Allocated memory is still 73.4 MB. Free memory is still 44.4 MB. There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 68]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryArithmeticDOUBLE_SMToperation at line 63, overapproximation of someBinaryDOUBLE_SMTComparisonOperation at line 18. Possible FailurePath: [L63] double x = 0.0 / 0.0; [L64] double y = 0.0 / 0.0; [L20] __uint32_t msw, lsw; [L23] ieee_double_shape_type ew_u; [L24] ew_u.value = (x) [L25] EXPR ew_u.parts.msw [L25] (msw) = ew_u.parts.msw [L26] EXPR ew_u.parts.lsw [L26] (lsw) = ew_u.parts.lsw [L29-L30] COND FALSE !((msw == 0x00000000 && lsw == 0x00000000) || (msw == 0x80000000 && lsw == 0x00000000)) [L32-L33] COND FALSE !((msw >= 0x00100000 && msw <= 0x7fefffff) || (msw >= 0x80100000 && msw <= 0xffefffff)) [L35-L36] COND FALSE !(( msw <= 0x000fffff) || (msw >= 0x80000000 && msw <= 0x800fffff)) [L39-L40] COND FALSE !((msw == 0x7ff00000 && lsw == 0x00000000) || (msw == 0xfff00000 && lsw == 0x00000000)) [L43] return 0; [L47] COND TRUE __fpclassify_double(x) == 0 [L48] return y; [L65] double res = fmin_double(x, y); [L18] return x != x; [L67] COND TRUE !isnan_double(res) [L68] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 28 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 1.1s, OverallIterations: 6, TraceHistogramMax: 1, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 206 SDtfs, 44 SDslu, 238 SDs, 0 SdLazy, 84 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 44 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 74 NumberOfCodeBlocks, 74 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 55 ConstructedInterpolants, 0 QuantifiedInterpolants, 799 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 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 Received shutdown request... ### Bit-precise run ### This is Ultimate 0.2.0-2880296 [2020-12-02 15:34:38,155 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-02 15:34:38,158 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-02 15:34:38,194 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-02 15:34:38,195 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-02 15:34:38,196 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-02 15:34:38,198 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-02 15:34:38,200 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-02 15:34:38,203 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-02 15:34:38,204 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-02 15:34:38,205 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-02 15:34:38,207 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-02 15:34:38,207 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-02 15:34:38,208 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-02 15:34:38,210 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-02 15:34:38,214 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-02 15:34:38,215 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-02 15:34:38,217 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-02 15:34:38,222 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-02 15:34:38,226 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-02 15:34:38,232 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-02 15:34:38,237 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-02 15:34:38,241 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-02 15:34:38,242 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-02 15:34:38,247 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-02 15:34:38,253 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-02 15:34:38,254 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-02 15:34:38,255 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-02 15:34:38,256 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-02 15:34:38,258 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-02 15:34:38,258 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-02 15:34:38,259 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-02 15:34:38,260 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-02 15:34:38,265 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-02 15:34:38,267 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-02 15:34:38,268 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-02 15:34:38,269 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-02 15:34:38,269 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-02 15:34:38,269 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-02 15:34:38,272 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-02 15:34:38,275 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-02 15:34:38,276 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2020-12-02 15:34:38,342 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-02 15:34:38,342 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-02 15:34:38,345 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-02 15:34:38,345 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-02 15:34:38,345 INFO L138 SettingsManager]: * Use SBE=true [2020-12-02 15:34:38,346 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-02 15:34:38,346 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-02 15:34:38,346 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-02 15:34:38,346 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-02 15:34:38,346 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-02 15:34:38,347 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-02 15:34:38,347 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-02 15:34:38,348 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-12-02 15:34:38,348 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-12-02 15:34:38,349 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-02 15:34:38,349 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-02 15:34:38,349 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-02 15:34:38,349 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-02 15:34:38,349 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-02 15:34:38,350 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-02 15:34:38,350 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-12-02 15:34:38,350 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-02 15:34:38,350 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-02 15:34:38,351 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-02 15:34:38,351 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-02 15:34:38,351 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-02 15:34:38,351 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2020-12-02 15:34:38,351 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2020-12-02 15:34:38,352 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-02 15:34:38,352 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-02 15:34:38,352 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-02 15:34:38,352 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 -> 858612fdb9071600e83746a6e504d4acbbe533c1 [2020-12-02 15:34:38,801 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-02 15:34:38,851 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-02 15:34:38,855 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-02 15:34:38,858 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-02 15:34:38,859 INFO L275 PluginConnector]: CDTParser initialized [2020-12-02 15:34:38,860 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/double_req_bl_1230.c [2020-12-02 15:34:38,945 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b673fb6d0/b09208e5ae2b4716a8bde5f74d208a8c/FLAG9b0bd9246 [2020-12-02 15:34:39,648 INFO L306 CDTParser]: Found 1 translation units. [2020-12-02 15:34:39,649 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/double_req_bl_1230.c [2020-12-02 15:34:39,660 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b673fb6d0/b09208e5ae2b4716a8bde5f74d208a8c/FLAG9b0bd9246 [2020-12-02 15:34:39,976 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b673fb6d0/b09208e5ae2b4716a8bde5f74d208a8c [2020-12-02 15:34:39,979 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-02 15:34:39,981 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-02 15:34:39,985 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-02 15:34:39,985 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-02 15:34:40,000 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-02 15:34:40,001 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:34:39" (1/1) ... [2020-12-02 15:34:40,006 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e18f6ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:34:40, skipping insertion in model container [2020-12-02 15:34:40,006 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:34:39" (1/1) ... [2020-12-02 15:34:40,016 INFO L146 MainTranslator]: Starting translation in SV-COMP mode [2020-12-02 15:34:40,034 INFO L179 MainTranslator]: Built tables and reachable declarations [2020-12-02 15:34:40,217 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/double_req_bl_1230.c[1667,1680] [2020-12-02 15:34:40,221 INFO L211 PostProcessor]: Analyzing one entry point: main [2020-12-02 15:34:40,238 INFO L212 MainTranslator]: Completed pre-run [2020-12-02 15:34:40,267 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/double_req_bl_1230.c[1667,1680] [2020-12-02 15:34:40,268 INFO L211 PostProcessor]: Analyzing one entry point: main [2020-12-02 15:34:40,293 INFO L217 MainTranslator]: Completed translation [2020-12-02 15:34:40,293 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:34:40 WrapperNode [2020-12-02 15:34:40,294 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-02 15:34:40,295 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-02 15:34:40,295 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-02 15:34:40,295 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-02 15:34:40,304 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:34:40" (1/1) ... [2020-12-02 15:34:40,317 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:34:40" (1/1) ... [2020-12-02 15:34:40,358 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-02 15:34:40,359 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-02 15:34:40,359 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-02 15:34:40,359 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-02 15:34:40,380 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:34:40" (1/1) ... [2020-12-02 15:34:40,380 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:34:40" (1/1) ... [2020-12-02 15:34:40,385 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:34:40" (1/1) ... [2020-12-02 15:34:40,385 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:34:40" (1/1) ... [2020-12-02 15:34:40,396 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:34:40" (1/1) ... [2020-12-02 15:34:40,401 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:34:40" (1/1) ... [2020-12-02 15:34:40,404 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:34:40" (1/1) ... [2020-12-02 15:34:40,408 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-02 15:34:40,410 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-02 15:34:40,410 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-02 15:34:40,410 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-02 15:34:40,411 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:34:40" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-02 15:34:40,520 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.float_to_bitvec_DOUBLE [2020-12-02 15:34:40,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2020-12-02 15:34:40,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2020-12-02 15:34:40,521 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-02 15:34:40,521 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2020-12-02 15:34:40,522 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-02 15:34:40,522 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-02 15:34:40,522 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-02 15:34:41,109 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-02 15:34:41,110 INFO L298 CfgBuilder]: Removed 16 assume(true) statements. [2020-12-02 15:34:41,115 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:34:41 BoogieIcfgContainer [2020-12-02 15:34:41,115 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-02 15:34:41,117 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-02 15:34:41,117 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-02 15:34:41,121 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-02 15:34:41,121 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 03:34:39" (1/3) ... [2020-12-02 15:34:41,122 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24ec7f3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 03:34:41, skipping insertion in model container [2020-12-02 15:34:41,123 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:34:40" (2/3) ... [2020-12-02 15:34:41,123 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24ec7f3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 03:34:41, skipping insertion in model container [2020-12-02 15:34:41,123 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:34:41" (3/3) ... [2020-12-02 15:34:41,125 INFO L111 eAbstractionObserver]: Analyzing ICFG double_req_bl_1230.c [2020-12-02 15:34:41,144 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-02 15:34:41,148 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-02 15:34:41,163 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-02 15:34:41,200 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-02 15:34:41,200 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-02 15:34:41,200 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-02 15:34:41,200 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-02 15:34:41,201 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-02 15:34:41,201 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-02 15:34:41,201 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-02 15:34:41,201 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-02 15:34:41,218 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2020-12-02 15:34:41,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-12-02 15:34:41,225 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 15:34:41,226 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 15:34:41,227 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 15:34:41,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 15:34:41,234 INFO L82 PathProgramCache]: Analyzing trace with hash -958093107, now seen corresponding path program 1 times [2020-12-02 15:34:41,248 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-02 15:34:41,249 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [613127326] [2020-12-02 15:34:41,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2020-12-02 15:34:42,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 15:34:43,002 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 1 conjunts are in the unsatisfiable core [2020-12-02 15:34:43,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-02 15:34:43,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 15:34:43,039 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-02 15:34:43,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 15:34:43,053 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [613127326] [2020-12-02 15:34:43,053 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-12-02 15:34:43,054 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2020-12-02 15:34:43,055 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927426129] [2020-12-02 15:34:43,060 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-12-02 15:34:43,060 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-12-02 15:34:43,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-12-02 15:34:43,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-02 15:34:43,078 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 2 states. [2020-12-02 15:34:43,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 15:34:43,100 INFO L93 Difference]: Finished difference Result 54 states and 84 transitions. [2020-12-02 15:34:43,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-12-02 15:34:43,101 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2020-12-02 15:34:43,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 15:34:43,112 INFO L225 Difference]: With dead ends: 54 [2020-12-02 15:34:43,113 INFO L226 Difference]: Without dead ends: 25 [2020-12-02 15:34:43,116 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-02 15:34:43,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-12-02 15:34:43,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2020-12-02 15:34:43,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-12-02 15:34:43,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 35 transitions. [2020-12-02 15:34:43,155 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 35 transitions. Word has length 10 [2020-12-02 15:34:43,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 15:34:43,155 INFO L481 AbstractCegarLoop]: Abstraction has 25 states and 35 transitions. [2020-12-02 15:34:43,155 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-12-02 15:34:43,156 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 35 transitions. [2020-12-02 15:34:43,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-12-02 15:34:43,156 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 15:34:43,157 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 15:34:43,369 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-12-02 15:34:43,370 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 15:34:43,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 15:34:43,372 INFO L82 PathProgramCache]: Analyzing trace with hash 1001566992, now seen corresponding path program 1 times [2020-12-02 15:34:43,374 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-02 15:34:43,374 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1717328537] [2020-12-02 15:34:43,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2020-12-02 15:34:44,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 15:34:45,038 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-02 15:34:45,040 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-02 15:34:45,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 15:34:45,101 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-02 15:34:45,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 15:34:45,127 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1717328537] [2020-12-02 15:34:45,127 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-12-02 15:34:45,127 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2020-12-02 15:34:45,127 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365376134] [2020-12-02 15:34:45,129 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-02 15:34:45,129 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-12-02 15:34:45,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-02 15:34:45,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-02 15:34:45,131 INFO L87 Difference]: Start difference. First operand 25 states and 35 transitions. Second operand 6 states. [2020-12-02 15:34:45,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 15:34:45,217 INFO L93 Difference]: Finished difference Result 52 states and 65 transitions. [2020-12-02 15:34:45,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-02 15:34:45,218 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2020-12-02 15:34:45,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 15:34:45,219 INFO L225 Difference]: With dead ends: 52 [2020-12-02 15:34:45,219 INFO L226 Difference]: Without dead ends: 47 [2020-12-02 15:34:45,220 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-12-02 15:34:45,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-12-02 15:34:45,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 27. [2020-12-02 15:34:45,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-12-02 15:34:45,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2020-12-02 15:34:45,236 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 37 transitions. Word has length 11 [2020-12-02 15:34:45,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 15:34:45,236 INFO L481 AbstractCegarLoop]: Abstraction has 27 states and 37 transitions. [2020-12-02 15:34:45,237 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-02 15:34:45,237 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2020-12-02 15:34:45,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-12-02 15:34:45,238 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 15:34:45,238 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 15:34:45,451 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-12-02 15:34:45,452 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 15:34:45,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 15:34:45,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1219229111, now seen corresponding path program 1 times [2020-12-02 15:34:45,456 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-02 15:34:45,456 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [243492112] [2020-12-02 15:34:45,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2020-12-02 15:34:47,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 15:34:47,198 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 13 conjunts are in the unsatisfiable core [2020-12-02 15:34:47,202 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-02 15:34:52,182 WARN L197 SmtUtils]: Spent 1.86 s on a formula simplification that was a NOOP. DAG size: 23 [2020-12-02 15:34:54,398 WARN L838 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_#t~nondet18_6| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet19_6| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_6|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_6|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_6|))) (.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_6|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_6|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_6|)))) (and (= .cse0 (_ +zero 11 53)) (= (fp.div roundNearestTiesToEven .cse0 .cse1) (fp ((_ extract 63 63) |c_ULTIMATE.start_fmin_double_#res|) ((_ extract 62 52) |c_ULTIMATE.start_fmin_double_#res|) ((_ extract 51 0) |c_ULTIMATE.start_fmin_double_#res|))) (= (_ +zero 11 53) .cse1)))) is different from false [2020-12-02 15:34:54,441 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 15:34:54,447 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 15:34:58,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 15:34:58,435 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-02 15:35:05,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 15:35:05,829 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [243492112] [2020-12-02 15:35:05,829 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-12-02 15:35:05,830 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 11 [2020-12-02 15:35:05,830 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894113861] [2020-12-02 15:35:05,830 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-02 15:35:05,830 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-12-02 15:35:05,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-02 15:35:05,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=70, Unknown=1, NotChecked=16, Total=110 [2020-12-02 15:35:05,832 INFO L87 Difference]: Start difference. First operand 27 states and 37 transitions. Second operand 11 states. [2020-12-02 15:35:18,735 WARN L197 SmtUtils]: Spent 1.75 s on a formula simplification. DAG size of input: 28 DAG size of output: 11 [2020-12-02 15:35:21,366 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_#t~nondet18_6| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet19_6| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_6|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_6|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_6|))) (.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_6|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_6|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_6|)))) (and (= .cse0 (_ +zero 11 53)) (= (fp.div roundNearestTiesToEven .cse0 .cse1) (fp ((_ extract 63 63) |c_ULTIMATE.start_fmin_double_#res|) ((_ extract 62 52) |c_ULTIMATE.start_fmin_double_#res|) ((_ extract 51 0) |c_ULTIMATE.start_fmin_double_#res|))) (= (_ +zero 11 53) .cse1)))) (exists ((|v_ULTIMATE.start_main_#t~nondet18_6| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet19_6| (_ BitVec 64))) (let ((.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_6|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_6|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_6|))) (.cse3 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_6|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_6|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_6|)))) (and (= .cse2 (_ +zero 11 53)) (= (fp.div roundNearestTiesToEven .cse2 .cse3) (fp ((_ extract 63 63) c_ULTIMATE.start_fmin_double_~y) ((_ extract 62 52) c_ULTIMATE.start_fmin_double_~y) ((_ extract 51 0) c_ULTIMATE.start_fmin_double_~y))) (= (_ +zero 11 53) .cse3)))) (= roundNearestTiesToEven c_~CRM) (not (let ((.cse4 (fp ((_ extract 63 63) |c_ULTIMATE.start_fmin_double_#res|) ((_ extract 62 52) |c_ULTIMATE.start_fmin_double_#res|) ((_ extract 51 0) |c_ULTIMATE.start_fmin_double_#res|)))) (fp.eq .cse4 .cse4))) (not (let ((.cse5 (fp ((_ extract 63 63) c_ULTIMATE.start_fmin_double_~y) ((_ extract 62 52) c_ULTIMATE.start_fmin_double_~y) ((_ extract 51 0) c_ULTIMATE.start_fmin_double_~y)))) (fp.eq .cse5 .cse5)))) is different from false [2020-12-02 15:35:22,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 15:35:22,062 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2020-12-02 15:35:22,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-02 15:35:22,063 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 14 [2020-12-02 15:35:22,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 15:35:22,064 INFO L225 Difference]: With dead ends: 36 [2020-12-02 15:35:22,065 INFO L226 Difference]: Without dead ends: 27 [2020-12-02 15:35:22,065 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 33.8s TimeCoverageRelationStatistics Valid=36, Invalid=101, Unknown=3, NotChecked=42, Total=182 [2020-12-02 15:35:22,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-12-02 15:35:22,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2020-12-02 15:35:22,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-12-02 15:35:22,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2020-12-02 15:35:22,071 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 33 transitions. Word has length 14 [2020-12-02 15:35:22,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 15:35:22,072 INFO L481 AbstractCegarLoop]: Abstraction has 25 states and 33 transitions. [2020-12-02 15:35:22,072 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-02 15:35:22,072 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2020-12-02 15:35:22,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-02 15:35:22,073 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 15:35:22,073 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 15:35:22,274 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-12-02 15:35:22,275 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 15:35:22,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 15:35:22,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1012428811, now seen corresponding path program 1 times [2020-12-02 15:35:22,277 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-02 15:35:22,278 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1319157653] [2020-12-02 15:35:22,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2020-12-02 15:35:23,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 15:35:23,984 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-02 15:35:23,986 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-02 15:35:24,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 15:35:24,104 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-02 15:35:24,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 15:35:24,281 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1319157653] [2020-12-02 15:35:24,281 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-12-02 15:35:24,281 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2020-12-02 15:35:24,282 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502653452] [2020-12-02 15:35:24,282 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-02 15:35:24,282 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-12-02 15:35:24,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-02 15:35:24,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-02 15:35:24,283 INFO L87 Difference]: Start difference. First operand 25 states and 33 transitions. Second operand 6 states. [2020-12-02 15:35:24,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 15:35:24,925 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2020-12-02 15:35:24,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-02 15:35:24,933 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-12-02 15:35:24,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 15:35:24,934 INFO L225 Difference]: With dead ends: 52 [2020-12-02 15:35:24,934 INFO L226 Difference]: Without dead ends: 47 [2020-12-02 15:35:24,935 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-12-02 15:35:24,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-12-02 15:35:24,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 27. [2020-12-02 15:35:24,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-12-02 15:35:24,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2020-12-02 15:35:24,950 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 16 [2020-12-02 15:35:24,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 15:35:24,950 INFO L481 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2020-12-02 15:35:24,950 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-02 15:35:24,951 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2020-12-02 15:35:24,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-12-02 15:35:24,953 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 15:35:24,953 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 15:35:25,153 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2020-12-02 15:35:25,154 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 15:35:25,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 15:35:25,155 INFO L82 PathProgramCache]: Analyzing trace with hash -356841937, now seen corresponding path program 1 times [2020-12-02 15:35:25,156 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-02 15:35:25,156 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [547234316] [2020-12-02 15:35:25,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2020-12-02 15:35:26,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 15:35:26,967 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 10 conjunts are in the unsatisfiable core [2020-12-02 15:35:26,969 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-02 15:35:31,894 WARN L197 SmtUtils]: Spent 1.73 s on a formula simplification that was a NOOP. DAG size: 23 [2020-12-02 15:35:43,613 WARN L197 SmtUtils]: Spent 1.57 s on a formula simplification that was a NOOP. DAG size: 23 [2020-12-02 15:36:01,358 WARN L197 SmtUtils]: Spent 1.62 s on a formula simplification that was a NOOP. DAG size: 26 [2020-12-02 15:36:01,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 15:36:01,399 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-02 15:36:06,462 WARN L197 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2020-12-02 15:36:11,777 WARN L197 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2020-12-02 15:36:17,500 WARN L197 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2020-12-02 15:36:17,517 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-02 15:36:17,519 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-12-02 15:36:20,576 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_#t~nondet18_8| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet19_8| (_ BitVec 64)) (v_ULTIMATE.start_fmin_double_~y_8 (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_8|))) (.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_8|)))) (or (not (= .cse0 (_ +zero 11 53))) (not (= (fp ((_ extract 63 63) v_ULTIMATE.start_fmin_double_~y_8) ((_ extract 62 52) v_ULTIMATE.start_fmin_double_~y_8) ((_ extract 51 0) v_ULTIMATE.start_fmin_double_~y_8)) (fp.div c_~CRM .cse1 .cse0))) (not (= .cse1 (_ +zero 11 53))) (not (= ((_ extract 63 32) v_ULTIMATE.start_fmin_double_~y_8) (_ bv0 32)))))) (forall ((|v_ULTIMATE.start_main_#t~nondet18_8| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet19_8| (_ BitVec 64)) (v_ULTIMATE.start_fmin_double_~y_8 (_ BitVec 64))) (let ((.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_8|))) (.cse3 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_8|)))) (or (not (= .cse2 (_ +zero 11 53))) (not (= (fp ((_ extract 63 63) v_ULTIMATE.start_fmin_double_~y_8) ((_ extract 62 52) v_ULTIMATE.start_fmin_double_~y_8) ((_ extract 51 0) v_ULTIMATE.start_fmin_double_~y_8)) (fp.div c_~CRM .cse3 .cse2))) (not (= .cse3 (_ +zero 11 53))) (not (= (bvadd ((_ extract 63 32) v_ULTIMATE.start_fmin_double_~y_8) (_ bv2147483648 32)) (_ bv0 32))))))) is different from true [2020-12-02 15:36:20,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 15:36:20,578 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [547234316] [2020-12-02 15:36:20,578 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-12-02 15:36:20,578 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2020-12-02 15:36:20,579 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040186037] [2020-12-02 15:36:20,579 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-02 15:36:20,579 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-12-02 15:36:20,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-02 15:36:20,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=48, Unknown=8, NotChecked=14, Total=90 [2020-12-02 15:36:20,580 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand 10 states. [2020-12-02 15:36:23,758 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_#t~nondet18_8| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet19_8| (_ BitVec 64)) (v_ULTIMATE.start_fmin_double_~y_8 (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_8|))) (.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_8|)))) (or (not (= .cse0 (_ +zero 11 53))) (not (= (fp ((_ extract 63 63) v_ULTIMATE.start_fmin_double_~y_8) ((_ extract 62 52) v_ULTIMATE.start_fmin_double_~y_8) ((_ extract 51 0) v_ULTIMATE.start_fmin_double_~y_8)) (fp.div c_~CRM .cse1 .cse0))) (not (= .cse1 (_ +zero 11 53))) (not (= ((_ extract 63 32) v_ULTIMATE.start_fmin_double_~y_8) (_ bv0 32)))))) (= roundNearestTiesToEven c_~CRM) (forall ((|v_ULTIMATE.start_main_#t~nondet18_8| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet19_8| (_ BitVec 64)) (v_ULTIMATE.start_fmin_double_~y_8 (_ BitVec 64))) (let ((.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_8|))) (.cse3 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_8|)))) (or (not (= .cse2 (_ +zero 11 53))) (not (= (fp ((_ extract 63 63) v_ULTIMATE.start_fmin_double_~y_8) ((_ extract 62 52) v_ULTIMATE.start_fmin_double_~y_8) ((_ extract 51 0) v_ULTIMATE.start_fmin_double_~y_8)) (fp.div c_~CRM .cse3 .cse2))) (not (= .cse3 (_ +zero 11 53))) (not (= (bvadd ((_ extract 63 32) v_ULTIMATE.start_fmin_double_~y_8) (_ bv2147483648 32)) (_ bv0 32))))))) is different from true [2020-12-02 15:36:52,745 WARN L197 SmtUtils]: Spent 5.49 s on a formula simplification that was a NOOP. DAG size: 32 [2020-12-02 15:36:58,055 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_#t~nondet18_8| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet19_8| (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_8|))) (.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_8|)))) (and (= (fp ((_ extract 63 63) c_ULTIMATE.start___fpclassify_double_~x) ((_ extract 62 52) c_ULTIMATE.start___fpclassify_double_~x) ((_ extract 51 0) c_ULTIMATE.start___fpclassify_double_~x)) (fp.div roundNearestTiesToEven .cse0 .cse1)) (= .cse1 (_ +zero 11 53)) (= .cse0 (_ +zero 11 53))))) (exists ((|v_ULTIMATE.start_main_#t~nondet18_8| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet19_8| (_ BitVec 64))) (let ((.cse3 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_8|))) (.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_8|)))) (and (= (fp ((_ extract 63 63) c_ULTIMATE.start_fmin_double_~y) ((_ extract 62 52) c_ULTIMATE.start_fmin_double_~y) ((_ extract 51 0) c_ULTIMATE.start_fmin_double_~y)) (fp.div roundNearestTiesToEven .cse2 .cse3)) (= .cse3 (_ +zero 11 53)) (= .cse2 (_ +zero 11 53)))))) is different from false [2020-12-02 15:37:08,662 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((ULTIMATE.start___fpclassify_double_~x (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet18_8| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet19_8| (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_8|))) (.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_8|)))) (and (= ((_ extract 63 32) ULTIMATE.start___fpclassify_double_~x) c_ULTIMATE.start___fpclassify_double_~msw~0) (= (fp ((_ extract 63 63) ULTIMATE.start___fpclassify_double_~x) ((_ extract 62 52) ULTIMATE.start___fpclassify_double_~x) ((_ extract 51 0) ULTIMATE.start___fpclassify_double_~x)) (fp.div roundNearestTiesToEven .cse0 .cse1)) (= .cse1 (_ +zero 11 53)) (= .cse0 (_ +zero 11 53))))) (exists ((|v_ULTIMATE.start_main_#t~nondet18_8| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet19_8| (_ BitVec 64))) (let ((.cse3 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_8|))) (.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_8|)))) (and (= (fp ((_ extract 63 63) c_ULTIMATE.start_fmin_double_~y) ((_ extract 62 52) c_ULTIMATE.start_fmin_double_~y) ((_ extract 51 0) c_ULTIMATE.start_fmin_double_~y)) (fp.div roundNearestTiesToEven .cse2 .cse3)) (= .cse3 (_ +zero 11 53)) (= .cse2 (_ +zero 11 53)))))) is different from false [2020-12-02 15:37:35,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 15:37:35,432 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2020-12-02 15:37:35,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-02 15:37:35,620 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2020-12-02 15:37:35,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 15:37:35,621 INFO L225 Difference]: With dead ends: 57 [2020-12-02 15:37:35,621 INFO L226 Difference]: Without dead ends: 48 [2020-12-02 15:37:35,622 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 80.2s TimeCoverageRelationStatistics Valid=31, Invalid=63, Unknown=12, NotChecked=76, Total=182 [2020-12-02 15:37:35,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-12-02 15:37:35,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 27. [2020-12-02 15:37:35,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-12-02 15:37:35,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2020-12-02 15:37:35,630 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 18 [2020-12-02 15:37:35,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 15:37:35,630 INFO L481 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2020-12-02 15:37:35,630 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-02 15:37:35,631 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2020-12-02 15:37:35,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-12-02 15:37:35,631 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 15:37:35,632 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 15:37:35,846 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2020-12-02 15:37:35,847 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 15:37:35,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 15:37:35,848 INFO L82 PathProgramCache]: Analyzing trace with hash 638497600, now seen corresponding path program 1 times [2020-12-02 15:37:35,849 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-02 15:37:35,850 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [65526906] [2020-12-02 15:37:35,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2020-12-02 15:37:37,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 15:37:37,620 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 10 conjunts are in the unsatisfiable core [2020-12-02 15:37:37,628 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-02 15:37:43,711 WARN L197 SmtUtils]: Spent 2.08 s on a formula simplification that was a NOOP. DAG size: 23 [2020-12-02 15:37:56,415 WARN L197 SmtUtils]: Spent 1.70 s on a formula simplification that was a NOOP. DAG size: 23 [2020-12-02 15:37:58,583 WARN L838 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start___fpclassify_double_~x (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet19_10| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet18_10| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_10|))) (.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_10|)))) (and (= .cse0 (_ +zero 11 53)) (= (fp.div roundNearestTiesToEven .cse0 .cse1) (fp ((_ extract 63 63) ULTIMATE.start___fpclassify_double_~x) ((_ extract 62 52) ULTIMATE.start___fpclassify_double_~x) ((_ extract 51 0) ULTIMATE.start___fpclassify_double_~x))) (= (_ +zero 11 53) .cse1) (= ((_ extract 63 32) ULTIMATE.start___fpclassify_double_~x) c_ULTIMATE.start___fpclassify_double_~msw~0)))) is different from false [2020-12-02 15:37:58,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 15:37:58,641 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-02 15:38:03,199 WARN L197 SmtUtils]: Spent 316.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2020-12-02 15:38:06,694 WARN L197 SmtUtils]: Spent 304.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2020-12-02 15:38:10,587 WARN L197 SmtUtils]: Spent 289.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2020-12-02 15:38:10,607 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-02 15:38:10,618 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-12-02 15:38:12,971 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_#t~nondet19_10| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet18_10| (_ BitVec 64)) (v_ULTIMATE.start_fmin_double_~y_9 (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_10|))) (.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_10|))) (.cse1 ((_ extract 63 32) v_ULTIMATE.start_fmin_double_~y_9))) (or (not (= .cse0 (_ +zero 11 53))) (not (bvuge .cse1 (_ bv1048576 32))) (not (= (fp.div c_~CRM .cse0 .cse2) (fp ((_ extract 63 63) v_ULTIMATE.start_fmin_double_~y_9) ((_ extract 62 52) v_ULTIMATE.start_fmin_double_~y_9) ((_ extract 51 0) v_ULTIMATE.start_fmin_double_~y_9)))) (not (= (_ +zero 11 53) .cse2)) (not (bvule .cse1 (_ bv2146435071 32)))))) (forall ((|v_ULTIMATE.start_main_#t~nondet19_10| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet18_10| (_ BitVec 64)) (v_ULTIMATE.start_fmin_double_~y_9 (_ BitVec 64))) (let ((.cse3 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_10|))) (.cse5 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_10|))) (.cse4 ((_ extract 63 32) v_ULTIMATE.start_fmin_double_~y_9))) (or (not (= .cse3 (_ +zero 11 53))) (not (bvule .cse4 (_ bv4293918719 32))) (not (= (fp.div c_~CRM .cse3 .cse5) (fp ((_ extract 63 63) v_ULTIMATE.start_fmin_double_~y_9) ((_ extract 62 52) v_ULTIMATE.start_fmin_double_~y_9) ((_ extract 51 0) v_ULTIMATE.start_fmin_double_~y_9)))) (not (= (_ +zero 11 53) .cse5)) (not (bvuge .cse4 (_ bv2148532224 32))))))) is different from true [2020-12-02 15:38:12,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 15:38:12,973 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [65526906] [2020-12-02 15:38:12,973 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-12-02 15:38:12,973 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2020-12-02 15:38:12,974 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005193157] [2020-12-02 15:38:12,974 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-02 15:38:12,974 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-12-02 15:38:12,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-02 15:38:12,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=39, Unknown=6, NotChecked=26, Total=90 [2020-12-02 15:38:12,975 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand 10 states. [2020-12-02 15:38:17,098 WARN L860 $PredicateComparison]: unable to prove that (and (= roundNearestTiesToEven c_~CRM) (forall ((|v_ULTIMATE.start_main_#t~nondet19_10| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet18_10| (_ BitVec 64)) (v_ULTIMATE.start_fmin_double_~y_9 (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_10|))) (.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_10|))) (.cse1 ((_ extract 63 32) v_ULTIMATE.start_fmin_double_~y_9))) (or (not (= .cse0 (_ +zero 11 53))) (not (bvuge .cse1 (_ bv1048576 32))) (not (= (fp.div c_~CRM .cse0 .cse2) (fp ((_ extract 63 63) v_ULTIMATE.start_fmin_double_~y_9) ((_ extract 62 52) v_ULTIMATE.start_fmin_double_~y_9) ((_ extract 51 0) v_ULTIMATE.start_fmin_double_~y_9)))) (not (= (_ +zero 11 53) .cse2)) (not (bvule .cse1 (_ bv2146435071 32)))))) (forall ((|v_ULTIMATE.start_main_#t~nondet19_10| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet18_10| (_ BitVec 64)) (v_ULTIMATE.start_fmin_double_~y_9 (_ BitVec 64))) (let ((.cse3 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_10|))) (.cse5 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_10|))) (.cse4 ((_ extract 63 32) v_ULTIMATE.start_fmin_double_~y_9))) (or (not (= .cse3 (_ +zero 11 53))) (not (bvule .cse4 (_ bv4293918719 32))) (not (= (fp.div c_~CRM .cse3 .cse5) (fp ((_ extract 63 63) v_ULTIMATE.start_fmin_double_~y_9) ((_ extract 62 52) v_ULTIMATE.start_fmin_double_~y_9) ((_ extract 51 0) v_ULTIMATE.start_fmin_double_~y_9)))) (not (= (_ +zero 11 53) .cse5)) (not (bvuge .cse4 (_ bv2148532224 32))))))) is different from true [2020-12-02 15:38:28,277 WARN L195 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2020-12-02 15:38:28,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-02 15:38:28,479 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2020-12-02 15:38:28,481 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:209) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:226) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:153) 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.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:138) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:899) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:773) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:345) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:388) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:281) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:78) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1064) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:966) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:187) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:743) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:674) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:473) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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:206) ... 45 more [2020-12-02 15:38:28,494 INFO L168 Benchmark]: Toolchain (without parser) took 228509.10 ms. Allocated memory was 39.8 MB in the beginning and 58.7 MB in the end (delta: 18.9 MB). Free memory was 15.4 MB in the beginning and 31.9 MB in the end (delta: -16.5 MB). Peak memory consumption was 5.2 MB. Max. memory is 16.1 GB. [2020-12-02 15:38:28,495 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 39.8 MB. Free memory was 24.7 MB in the beginning and 24.7 MB in the end (delta: 26.9 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-02 15:38:28,495 INFO L168 Benchmark]: CACSL2BoogieTranslator took 309.37 ms. Allocated memory was 39.8 MB in the beginning and 48.2 MB in the end (delta: 8.4 MB). Free memory was 15.2 MB in the beginning and 21.3 MB in the end (delta: -6.1 MB). Peak memory consumption was 5.6 MB. Max. memory is 16.1 GB. [2020-12-02 15:38:28,496 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.59 ms. Allocated memory is still 48.2 MB. Free memory was 21.1 MB in the beginning and 31.0 MB in the end (delta: -9.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 16.1 GB. [2020-12-02 15:38:28,497 INFO L168 Benchmark]: Boogie Preprocessor took 49.47 ms. Allocated memory is still 48.2 MB. Free memory was 31.0 MB in the beginning and 29.4 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-02 15:38:28,498 INFO L168 Benchmark]: RCFGBuilder took 705.58 ms. Allocated memory is still 48.2 MB. Free memory was 29.4 MB in the beginning and 20.6 MB in the end (delta: 8.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 16.1 GB. [2020-12-02 15:38:28,498 INFO L168 Benchmark]: TraceAbstraction took 227372.32 ms. Allocated memory was 48.2 MB in the beginning and 58.7 MB in the end (delta: 10.5 MB). Free memory was 20.0 MB in the beginning and 31.9 MB in the end (delta: -12.0 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-02 15:38:28,505 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.30 ms. Allocated memory is still 39.8 MB. Free memory was 24.7 MB in the beginning and 24.7 MB in the end (delta: 26.9 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 309.37 ms. Allocated memory was 39.8 MB in the beginning and 48.2 MB in the end (delta: 8.4 MB). Free memory was 15.2 MB in the beginning and 21.3 MB in the end (delta: -6.1 MB). Peak memory consumption was 5.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 63.59 ms. Allocated memory is still 48.2 MB. Free memory was 21.1 MB in the beginning and 31.0 MB in the end (delta: -9.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 49.47 ms. Allocated memory is still 48.2 MB. Free memory was 31.0 MB in the beginning and 29.4 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 705.58 ms. Allocated memory is still 48.2 MB. Free memory was 29.4 MB in the beginning and 20.6 MB in the end (delta: 8.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 16.1 GB. * TraceAbstraction took 227372.32 ms. Allocated memory was 48.2 MB in the beginning and 58.7 MB in the end (delta: 10.5 MB). Free memory was 20.0 MB in the beginning and 31.9 MB in the end (delta: -12.0 MB). There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:209) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...