./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/floats-esbmc-regression/Float_div_bad.i.p+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c3fed411 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/floats-esbmc-regression/Float_div_bad.i.p+cfa-reducer.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 4582c3eb38d182065b024eaa1ecbc8cf3ce1cd8f100c8eebac06484d412900d6 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-17 07:15:01,470 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-17 07:15:01,472 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-17 07:15:01,512 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-17 07:15:01,518 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-17 07:15:01,519 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-17 07:15:01,521 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-17 07:15:01,524 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-17 07:15:01,526 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-17 07:15:01,527 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-17 07:15:01,528 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-17 07:15:01,529 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-17 07:15:01,530 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-17 07:15:01,532 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-17 07:15:01,533 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-17 07:15:01,534 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-17 07:15:01,536 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-17 07:15:01,540 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-17 07:15:01,542 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-17 07:15:01,543 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-17 07:15:01,549 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-17 07:15:01,550 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-17 07:15:01,550 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-17 07:15:01,551 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-17 07:15:01,553 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-17 07:15:01,554 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-17 07:15:01,555 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-17 07:15:01,555 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-17 07:15:01,556 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-17 07:15:01,557 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-17 07:15:01,557 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-17 07:15:01,557 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-17 07:15:01,558 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-17 07:15:01,559 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-17 07:15:01,559 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-17 07:15:01,560 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-17 07:15:01,561 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-17 07:15:01,561 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-17 07:15:01,561 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-17 07:15:01,562 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-17 07:15:01,563 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-17 07:15:01,563 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-17 07:15:01,592 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-17 07:15:01,592 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-17 07:15:01,593 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-17 07:15:01,593 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-17 07:15:01,594 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-17 07:15:01,594 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-17 07:15:01,594 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-17 07:15:01,594 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-17 07:15:01,595 INFO L138 SettingsManager]: * Use SBE=true [2021-12-17 07:15:01,595 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-17 07:15:01,596 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-17 07:15:01,596 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-17 07:15:01,596 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-17 07:15:01,596 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-17 07:15:01,596 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-17 07:15:01,596 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-17 07:15:01,596 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-17 07:15:01,597 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-17 07:15:01,597 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-17 07:15:01,597 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-17 07:15:01,597 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-17 07:15:01,597 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-17 07:15:01,597 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-17 07:15:01,597 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-17 07:15:01,598 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 07:15:01,598 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-17 07:15:01,598 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-17 07:15:01,598 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-17 07:15:01,598 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-17 07:15:01,598 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-17 07:15:01,598 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-17 07:15:01,599 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-17 07:15:01,599 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-17 07:15:01,599 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-17 07:15:01,599 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 -> 4582c3eb38d182065b024eaa1ecbc8cf3ce1cd8f100c8eebac06484d412900d6 [2021-12-17 07:15:01,804 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-17 07:15:01,837 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-17 07:15:01,839 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-17 07:15:01,840 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-17 07:15:01,840 INFO L275 PluginConnector]: CDTParser initialized [2021-12-17 07:15:01,841 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/floats-esbmc-regression/Float_div_bad.i.p+cfa-reducer.c [2021-12-17 07:15:01,893 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00dac048c/ec2a8e12efb647afb32da84d21ec9ba5/FLAGcb7d0b390 [2021-12-17 07:15:02,203 INFO L306 CDTParser]: Found 1 translation units. [2021-12-17 07:15:02,203 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-esbmc-regression/Float_div_bad.i.p+cfa-reducer.c [2021-12-17 07:15:02,210 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00dac048c/ec2a8e12efb647afb32da84d21ec9ba5/FLAGcb7d0b390 [2021-12-17 07:15:02,639 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00dac048c/ec2a8e12efb647afb32da84d21ec9ba5 [2021-12-17 07:15:02,642 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-17 07:15:02,643 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-17 07:15:02,644 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-17 07:15:02,644 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-17 07:15:02,646 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-17 07:15:02,647 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 07:15:02" (1/1) ... [2021-12-17 07:15:02,648 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ae24893 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:15:02, skipping insertion in model container [2021-12-17 07:15:02,648 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 07:15:02" (1/1) ... [2021-12-17 07:15:02,653 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-17 07:15:02,663 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-17 07:15:02,835 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-esbmc-regression/Float_div_bad.i.p+cfa-reducer.c[699,712] [2021-12-17 07:15:02,840 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 07:15:02,847 INFO L203 MainTranslator]: Completed pre-run [2021-12-17 07:15:02,860 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-esbmc-regression/Float_div_bad.i.p+cfa-reducer.c[699,712] [2021-12-17 07:15:02,862 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 07:15:02,872 INFO L208 MainTranslator]: Completed translation [2021-12-17 07:15:02,872 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:15:02 WrapperNode [2021-12-17 07:15:02,873 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-17 07:15:02,874 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-17 07:15:02,874 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-17 07:15:02,874 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-17 07:15:02,879 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:15:02" (1/1) ... [2021-12-17 07:15:02,884 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:15:02" (1/1) ... [2021-12-17 07:15:02,896 INFO L137 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 28 [2021-12-17 07:15:02,896 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-17 07:15:02,897 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-17 07:15:02,897 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-17 07:15:02,897 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-17 07:15:02,902 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:15:02" (1/1) ... [2021-12-17 07:15:02,902 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:15:02" (1/1) ... [2021-12-17 07:15:02,904 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:15:02" (1/1) ... [2021-12-17 07:15:02,904 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:15:02" (1/1) ... [2021-12-17 07:15:02,908 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:15:02" (1/1) ... [2021-12-17 07:15:02,909 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:15:02" (1/1) ... [2021-12-17 07:15:02,909 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:15:02" (1/1) ... [2021-12-17 07:15:02,910 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-17 07:15:02,911 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-17 07:15:02,911 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-17 07:15:02,911 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-17 07:15:02,912 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:15:02" (1/1) ... [2021-12-17 07:15:02,916 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 07:15:02,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 07:15:02,949 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-17 07:15:02,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-17 07:15:02,992 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-17 07:15:02,992 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-17 07:15:02,992 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-17 07:15:02,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-17 07:15:03,036 INFO L236 CfgBuilder]: Building ICFG [2021-12-17 07:15:03,037 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-17 07:15:03,116 INFO L277 CfgBuilder]: Performing block encoding [2021-12-17 07:15:03,121 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-17 07:15:03,121 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-17 07:15:03,123 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 07:15:03 BoogieIcfgContainer [2021-12-17 07:15:03,123 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-17 07:15:03,125 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-17 07:15:03,125 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-17 07:15:03,127 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-17 07:15:03,128 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.12 07:15:02" (1/3) ... [2021-12-17 07:15:03,129 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b5773ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 07:15:03, skipping insertion in model container [2021-12-17 07:15:03,129 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:15:02" (2/3) ... [2021-12-17 07:15:03,129 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b5773ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 07:15:03, skipping insertion in model container [2021-12-17 07:15:03,129 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 07:15:03" (3/3) ... [2021-12-17 07:15:03,130 INFO L111 eAbstractionObserver]: Analyzing ICFG Float_div_bad.i.p+cfa-reducer.c [2021-12-17 07:15:03,134 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-17 07:15:03,134 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-17 07:15:03,168 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-17 07:15:03,174 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-17 07:15:03,174 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-17 07:15:03,185 INFO L276 IsEmpty]: Start isEmpty. Operand has 9 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 07:15:03,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-12-17 07:15:03,192 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 07:15:03,192 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-12-17 07:15:03,193 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 07:15:03,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 07:15:03,199 INFO L85 PathProgramCache]: Analyzing trace with hash 28696774, now seen corresponding path program 1 times [2021-12-17 07:15:03,205 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 07:15:03,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320450386] [2021-12-17 07:15:03,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 07:15:03,207 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 07:15:03,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-17 07:15:03,274 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-17 07:15:03,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-17 07:15:03,306 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-17 07:15:03,308 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-17 07:15:03,309 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-17 07:15:03,311 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-17 07:15:03,314 INFO L732 BasicCegarLoop]: Path program histogram: [1] [2021-12-17 07:15:03,317 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-17 07:15:03,336 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.12 07:15:03 BoogieIcfgContainer [2021-12-17 07:15:03,336 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-17 07:15:03,338 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-17 07:15:03,338 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-17 07:15:03,338 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-17 07:15:03,339 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 07:15:03" (3/4) ... [2021-12-17 07:15:03,341 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-17 07:15:03,341 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-17 07:15:03,342 INFO L158 Benchmark]: Toolchain (without parser) took 699.00ms. Allocated memory was 100.7MB in the beginning and 125.8MB in the end (delta: 25.2MB). Free memory was 74.6MB in the beginning and 78.1MB in the end (delta: -3.5MB). Peak memory consumption was 19.1MB. Max. memory is 16.1GB. [2021-12-17 07:15:03,343 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 100.7MB. Free memory is still 57.8MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-17 07:15:03,344 INFO L158 Benchmark]: CACSL2BoogieTranslator took 229.15ms. Allocated memory was 100.7MB in the beginning and 125.8MB in the end (delta: 25.2MB). Free memory was 74.4MB in the beginning and 102.0MB in the end (delta: -27.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-17 07:15:03,345 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.65ms. Allocated memory is still 125.8MB. Free memory was 102.0MB in the beginning and 100.5MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-17 07:15:03,345 INFO L158 Benchmark]: Boogie Preprocessor took 13.57ms. Allocated memory is still 125.8MB. Free memory was 100.5MB in the beginning and 99.5MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-17 07:15:03,348 INFO L158 Benchmark]: RCFGBuilder took 212.64ms. Allocated memory is still 125.8MB. Free memory was 99.5MB in the beginning and 91.2MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-17 07:15:03,349 INFO L158 Benchmark]: TraceAbstraction took 211.38ms. Allocated memory is still 125.8MB. Free memory was 90.7MB in the beginning and 78.6MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-12-17 07:15:03,349 INFO L158 Benchmark]: Witness Printer took 3.04ms. Allocated memory is still 125.8MB. Free memory was 78.3MB in the beginning and 78.1MB in the end (delta: 250.6kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-17 07:15:03,351 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.19ms. Allocated memory is still 100.7MB. Free memory is still 57.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 229.15ms. Allocated memory was 100.7MB in the beginning and 125.8MB in the end (delta: 25.2MB). Free memory was 74.4MB in the beginning and 102.0MB in the end (delta: -27.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.65ms. Allocated memory is still 125.8MB. Free memory was 102.0MB in the beginning and 100.5MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 13.57ms. Allocated memory is still 125.8MB. Free memory was 100.5MB in the beginning and 99.5MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 212.64ms. Allocated memory is still 125.8MB. Free memory was 99.5MB in the beginning and 91.2MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 211.38ms. Allocated memory is still 125.8MB. Free memory was 90.7MB in the beginning and 78.6MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Witness Printer took 3.04ms. Allocated memory is still 125.8MB. Free memory was 78.3MB in the beginning and 78.1MB in the end (delta: 250.6kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 27]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 12, overapproximation of someBinaryArithmeticDOUBLEoperation at line 10. Possible FailurePath: [L1] int __return_main; VAL [__return_main=0] [L9] float main__x = 1.0; [L10] float main__x1 = main__x / 1.600000023841858; VAL [__return_main=0, main__x=1] [L12] COND FALSE !(main__x1 != main__x) [L21] int __tmp_1; [L22] __tmp_1 = main__x == 0 [L23] int __VERIFIER_assert__cond; [L24] __VERIFIER_assert__cond = __tmp_1 VAL [__return_main=0, __tmp_1=0, __VERIFIER_assert__cond=0, main__x=1] [L25] COND TRUE __VERIFIER_assert__cond == 0 VAL [__return_main=0, __tmp_1=0, __VERIFIER_assert__cond=0, main__x=1] [L27] reach_error() VAL [__return_main=0, __tmp_1=0, __VERIFIER_assert__cond=0, main__x=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 9 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.1s, OverallIterations: 1, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 5 NumberOfCodeBlocks, 5 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-12-17 07:15:03,403 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/floats-esbmc-regression/Float_div_bad.i.p+cfa-reducer.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 4582c3eb38d182065b024eaa1ecbc8cf3ce1cd8f100c8eebac06484d412900d6 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-17 07:15:05,112 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-17 07:15:05,113 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-17 07:15:05,157 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-17 07:15:05,157 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-17 07:15:05,158 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-17 07:15:05,159 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-17 07:15:05,160 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-17 07:15:05,162 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-17 07:15:05,162 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-17 07:15:05,163 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-17 07:15:05,164 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-17 07:15:05,164 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-17 07:15:05,165 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-17 07:15:05,166 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-17 07:15:05,167 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-17 07:15:05,167 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-17 07:15:05,168 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-17 07:15:05,169 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-17 07:15:05,171 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-17 07:15:05,172 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-17 07:15:05,173 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-17 07:15:05,174 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-17 07:15:05,174 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-17 07:15:05,176 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-17 07:15:05,176 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-17 07:15:05,177 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-17 07:15:05,177 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-17 07:15:05,178 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-17 07:15:05,178 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-17 07:15:05,178 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-17 07:15:05,179 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-17 07:15:05,180 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-17 07:15:05,181 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-17 07:15:05,182 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-17 07:15:05,183 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-17 07:15:05,184 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-17 07:15:05,184 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-17 07:15:05,185 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-17 07:15:05,185 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-17 07:15:05,186 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-17 07:15:05,187 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2021-12-17 07:15:05,213 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-17 07:15:05,213 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-17 07:15:05,214 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-17 07:15:05,214 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-17 07:15:05,215 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-17 07:15:05,215 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-17 07:15:05,216 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-17 07:15:05,216 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-17 07:15:05,216 INFO L138 SettingsManager]: * Use SBE=true [2021-12-17 07:15:05,216 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-17 07:15:05,217 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-17 07:15:05,217 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-17 07:15:05,217 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-17 07:15:05,217 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-17 07:15:05,217 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-17 07:15:05,218 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-17 07:15:05,218 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-17 07:15:05,218 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-17 07:15:05,218 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-17 07:15:05,218 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-17 07:15:05,218 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-17 07:15:05,218 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-17 07:15:05,218 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-17 07:15:05,219 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-17 07:15:05,219 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-17 07:15:05,219 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-17 07:15:05,219 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 07:15:05,219 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-17 07:15:05,220 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-17 07:15:05,220 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-17 07:15:05,220 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-17 07:15:05,220 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-17 07:15:05,220 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-17 07:15:05,220 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-17 07:15:05,220 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-17 07:15:05,221 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-17 07:15:05,221 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-17 07:15:05,221 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 -> 4582c3eb38d182065b024eaa1ecbc8cf3ce1cd8f100c8eebac06484d412900d6 [2021-12-17 07:15:05,485 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-17 07:15:05,514 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-17 07:15:05,517 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-17 07:15:05,517 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-17 07:15:05,518 INFO L275 PluginConnector]: CDTParser initialized [2021-12-17 07:15:05,519 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/floats-esbmc-regression/Float_div_bad.i.p+cfa-reducer.c [2021-12-17 07:15:05,562 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76fed0d80/9c3d56a4aec8402b979ea1abbbb3feaf/FLAG6d95b78b1 [2021-12-17 07:15:05,936 INFO L306 CDTParser]: Found 1 translation units. [2021-12-17 07:15:05,936 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-esbmc-regression/Float_div_bad.i.p+cfa-reducer.c [2021-12-17 07:15:05,940 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76fed0d80/9c3d56a4aec8402b979ea1abbbb3feaf/FLAG6d95b78b1 [2021-12-17 07:15:06,370 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76fed0d80/9c3d56a4aec8402b979ea1abbbb3feaf [2021-12-17 07:15:06,373 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-17 07:15:06,375 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-17 07:15:06,377 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-17 07:15:06,377 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-17 07:15:06,380 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-17 07:15:06,380 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 07:15:06" (1/1) ... [2021-12-17 07:15:06,381 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7521152f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:15:06, skipping insertion in model container [2021-12-17 07:15:06,382 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 07:15:06" (1/1) ... [2021-12-17 07:15:06,386 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-17 07:15:06,398 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-17 07:15:06,519 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-esbmc-regression/Float_div_bad.i.p+cfa-reducer.c[699,712] [2021-12-17 07:15:06,524 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 07:15:06,533 INFO L203 MainTranslator]: Completed pre-run [2021-12-17 07:15:06,546 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-esbmc-regression/Float_div_bad.i.p+cfa-reducer.c[699,712] [2021-12-17 07:15:06,547 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 07:15:06,561 INFO L208 MainTranslator]: Completed translation [2021-12-17 07:15:06,562 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:15:06 WrapperNode [2021-12-17 07:15:06,562 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-17 07:15:06,563 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-17 07:15:06,563 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-17 07:15:06,563 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-17 07:15:06,568 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:15:06" (1/1) ... [2021-12-17 07:15:06,579 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:15:06" (1/1) ... [2021-12-17 07:15:06,606 INFO L137 Inliner]: procedures = 13, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 29 [2021-12-17 07:15:06,606 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-17 07:15:06,607 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-17 07:15:06,607 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-17 07:15:06,607 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-17 07:15:06,613 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:15:06" (1/1) ... [2021-12-17 07:15:06,613 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:15:06" (1/1) ... [2021-12-17 07:15:06,623 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:15:06" (1/1) ... [2021-12-17 07:15:06,624 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:15:06" (1/1) ... [2021-12-17 07:15:06,628 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:15:06" (1/1) ... [2021-12-17 07:15:06,646 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:15:06" (1/1) ... [2021-12-17 07:15:06,650 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:15:06" (1/1) ... [2021-12-17 07:15:06,651 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-17 07:15:06,653 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-17 07:15:06,654 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-17 07:15:06,654 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-17 07:15:06,655 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:15:06" (1/1) ... [2021-12-17 07:15:06,659 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 07:15:06,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 07:15:06,713 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-17 07:15:06,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-17 07:15:06,775 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-17 07:15:06,775 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-17 07:15:06,776 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-17 07:15:06,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-17 07:15:06,816 INFO L236 CfgBuilder]: Building ICFG [2021-12-17 07:15:06,817 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-17 07:15:11,208 INFO L277 CfgBuilder]: Performing block encoding [2021-12-17 07:15:11,219 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-17 07:15:11,220 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-17 07:15:11,221 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 07:15:11 BoogieIcfgContainer [2021-12-17 07:15:11,221 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-17 07:15:11,222 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-17 07:15:11,222 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-17 07:15:11,224 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-17 07:15:11,225 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.12 07:15:06" (1/3) ... [2021-12-17 07:15:11,225 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42643d5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 07:15:11, skipping insertion in model container [2021-12-17 07:15:11,225 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:15:06" (2/3) ... [2021-12-17 07:15:11,226 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42643d5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 07:15:11, skipping insertion in model container [2021-12-17 07:15:11,226 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 07:15:11" (3/3) ... [2021-12-17 07:15:11,227 INFO L111 eAbstractionObserver]: Analyzing ICFG Float_div_bad.i.p+cfa-reducer.c [2021-12-17 07:15:11,241 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-17 07:15:11,255 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-17 07:15:11,286 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-17 07:15:11,290 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-17 07:15:11,291 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-17 07:15:11,299 INFO L276 IsEmpty]: Start isEmpty. Operand has 9 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 07:15:11,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-12-17 07:15:11,305 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 07:15:11,306 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-12-17 07:15:11,306 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 07:15:11,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 07:15:11,320 INFO L85 PathProgramCache]: Analyzing trace with hash 28696774, now seen corresponding path program 1 times [2021-12-17 07:15:11,333 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 07:15:11,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1942535855] [2021-12-17 07:15:11,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 07:15:11,334 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 07:15:11,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 07:15:11,336 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 07:15:11,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-12-17 07:15:11,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 07:15:11,999 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-17 07:15:12,002 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 07:15:18,793 WARN L860 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~main__x1~0#1| ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven |c_ULTIMATE.start_main_~main__x~0#1|) ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0))))) (= |c_ULTIMATE.start_main_~main__x~0#1| ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)))) is different from true [2021-12-17 07:15:18,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 07:15:18,823 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 07:15:18,823 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 07:15:18,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1942535855] [2021-12-17 07:15:18,824 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1942535855] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 07:15:18,824 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 07:15:18,824 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-17 07:15:18,825 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074012275] [2021-12-17 07:15:18,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 07:15:18,829 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-17 07:15:18,829 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 07:15:18,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-17 07:15:18,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2021-12-17 07:15:18,849 INFO L87 Difference]: Start difference. First operand has 9 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 07:15:21,341 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.48s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 07:15:21,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 07:15:21,520 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2021-12-17 07:15:21,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-17 07:15:21,522 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2021-12-17 07:15:21,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 07:15:21,527 INFO L225 Difference]: With dead ends: 16 [2021-12-17 07:15:21,527 INFO L226 Difference]: Without dead ends: 7 [2021-12-17 07:15:21,529 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2021-12-17 07:15:21,534 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 0 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 8 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2021-12-17 07:15:21,536 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 12 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 1 Unknown, 8 Unchecked, 2.7s Time] [2021-12-17 07:15:21,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2021-12-17 07:15:21,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2021-12-17 07:15:21,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 07:15:21,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2021-12-17 07:15:21,565 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2021-12-17 07:15:21,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 07:15:21,565 INFO L470 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2021-12-17 07:15:21,566 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 07:15:21,566 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2021-12-17 07:15:21,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-17 07:15:21,566 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 07:15:21,567 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-17 07:15:21,589 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-12-17 07:15:21,784 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 07:15:21,784 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 07:15:21,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 07:15:21,785 INFO L85 PathProgramCache]: Analyzing trace with hash 889537510, now seen corresponding path program 1 times [2021-12-17 07:15:21,785 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 07:15:21,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2107024649] [2021-12-17 07:15:21,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 07:15:21,786 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 07:15:21,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 07:15:21,787 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 07:15:21,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-12-17 07:15:23,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 07:15:23,141 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-17 07:15:23,142 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 07:15:28,605 WARN L860 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (= |c_ULTIMATE.start_main_~main__x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))))) is different from true [2021-12-17 07:15:34,741 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (and (= |c_ULTIMATE.start_main_~main__x~0#1| ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) .cse0))) (= |c_ULTIMATE.start_main_~main__x1~0#1| ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven |c_ULTIMATE.start_main_~main__x~0#1|) .cse0))))) is different from true [2021-12-17 07:15:34,798 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2021-12-17 07:15:34,798 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 07:15:41,409 WARN L838 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1|) ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) |c_ULTIMATE.start_main_~main__x1~0#1|)) is different from false [2021-12-17 07:15:43,579 WARN L860 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1|) ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) |c_ULTIMATE.start_main_~main__x1~0#1|)) is different from true [2021-12-17 07:15:50,520 WARN L838 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from false [2021-12-17 07:15:52,836 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from true [2021-12-17 07:15:52,837 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2021-12-17 07:15:52,837 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 07:15:52,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2107024649] [2021-12-17 07:15:52,837 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2107024649] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 07:15:52,837 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 07:15:52,837 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2021-12-17 07:15:52,838 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424781992] [2021-12-17 07:15:52,838 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 07:15:52,839 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-17 07:15:52,839 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 07:15:52,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-17 07:15:52,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=9, Unknown=6, NotChecked=28, Total=56 [2021-12-17 07:15:52,839 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand has 8 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 07:15:55,207 WARN L860 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0))))) is different from true [2021-12-17 07:15:57,558 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (and (= c_currentRoundingMode roundNearestTiesToEven) (= |c_ULTIMATE.start_main_~main__x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1|) .cse0)) |c_ULTIMATE.start_main_~main__x1~0#1|)))) is different from true [2021-12-17 07:16:12,413 WARN L227 SmtUtils]: Spent 10.83s on a formula simplification that was a NOOP. DAG size: 19 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 07:16:14,852 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.44s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 07:16:15,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 07:16:15,088 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2021-12-17 07:16:15,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-17 07:16:15,090 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-12-17 07:16:15,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 07:16:15,099 INFO L225 Difference]: With dead ends: 11 [2021-12-17 07:16:15,099 INFO L226 Difference]: Without dead ends: 8 [2021-12-17 07:16:15,099 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 32.9s TimeCoverageRelationStatistics Valid=20, Invalid=15, Unknown=9, NotChecked=66, Total=110 [2021-12-17 07:16:15,100 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 17 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2021-12-17 07:16:15,101 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 9 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 17 Unchecked, 2.7s Time] [2021-12-17 07:16:15,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2021-12-17 07:16:15,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2021-12-17 07:16:15,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 07:16:15,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2021-12-17 07:16:15,105 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2021-12-17 07:16:15,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 07:16:15,105 INFO L470 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2021-12-17 07:16:15,105 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 07:16:15,106 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2021-12-17 07:16:15,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-12-17 07:16:15,106 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 07:16:15,106 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2021-12-17 07:16:15,145 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-12-17 07:16:15,315 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 07:16:15,316 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 07:16:15,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 07:16:15,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1805796550, now seen corresponding path program 2 times [2021-12-17 07:16:15,317 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 07:16:15,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [780434513] [2021-12-17 07:16:15,317 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 07:16:15,317 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 07:16:15,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 07:16:15,320 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 07:16:15,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-12-17 07:16:17,402 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 07:16:17,403 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 07:16:17,512 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-17 07:16:17,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 07:16:21,876 WARN L860 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (= |c_ULTIMATE.start_main_~main__x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))))) is different from true [2021-12-17 07:16:27,114 WARN L227 SmtUtils]: Spent 5.23s on a formula simplification that was a NOOP. DAG size: 3 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-17 07:16:29,508 WARN L860 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (= |c_ULTIMATE.start_main_~main__x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))))) is different from true [2021-12-17 07:16:35,476 WARN L227 SmtUtils]: Spent 5.96s on a formula simplification that was a NOOP. DAG size: 3 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-17 07:16:41,939 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (and (= c_currentRoundingMode roundNearestTiesToEven) (= |c_ULTIMATE.start_main_~main__x~0#1| ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) (= |c_ULTIMATE.start_main_~main__x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x~0#1|) .cse0))))) is different from true [2021-12-17 07:16:42,034 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2021-12-17 07:16:42,034 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 07:16:52,073 WARN L838 $PredicateComparison]: unable to prove that (or (fp.eq |c_ULTIMATE.start_main_~main__x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1|) ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) |c_ULTIMATE.start_main_~main__x1~0#1|))) is different from false [2021-12-17 07:16:54,247 WARN L860 $PredicateComparison]: unable to prove that (or (fp.eq |c_ULTIMATE.start_main_~main__x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1|) ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) |c_ULTIMATE.start_main_~main__x1~0#1|))) is different from true [2021-12-17 07:17:04,564 WARN L227 SmtUtils]: Spent 5.31s on a formula simplification that was a NOOP. DAG size: 10 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-17 07:17:06,920 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1|) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))))) is different from false [2021-12-17 07:17:09,278 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1|) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))))) is different from true [2021-12-17 07:17:14,894 WARN L227 SmtUtils]: Spent 5.61s on a formula simplification that was a NOOP. DAG size: 17 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-17 07:17:20,799 WARN L227 SmtUtils]: Spent 5.90s on a formula simplification that was a NOOP. DAG size: 15 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-17 07:17:23,281 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1))) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))))) is different from false [2021-12-17 07:17:25,788 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1))) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))))) is different from true [2021-12-17 07:17:25,788 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2021-12-17 07:17:25,789 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 07:17:25,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [780434513] [2021-12-17 07:17:25,789 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [780434513] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 07:17:25,789 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 07:17:25,789 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 10 [2021-12-17 07:17:25,789 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517484620] [2021-12-17 07:17:25,789 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 07:17:25,789 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-17 07:17:25,790 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 07:17:25,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-17 07:17:25,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=16, Unknown=9, NotChecked=66, Total=110 [2021-12-17 07:17:25,790 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 11 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 07:17:28,340 WARN L860 $PredicateComparison]: unable to prove that (and (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1))) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-12-17 07:17:30,883 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (and (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1|) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))))) (= |c_ULTIMATE.start_main_~main__x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1))))) is different from true [2021-12-17 07:17:33,403 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (and (= c_currentRoundingMode roundNearestTiesToEven) (or (fp.eq |c_ULTIMATE.start_main_~main__x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1|) .cse0)) |c_ULTIMATE.start_main_~main__x1~0#1|))) (= |c_ULTIMATE.start_main_~main__x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))))) is different from true [2021-12-17 07:17:35,951 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (and (= c_currentRoundingMode roundNearestTiesToEven) (= |c_ULTIMATE.start_main_~main__x~0#1| ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) (= |c_ULTIMATE.start_main_~main__x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x~0#1|) .cse0))) (or (not (fp.eq |c_ULTIMATE.start_main_~main__x1~0#1| |c_ULTIMATE.start_main_~main__x~0#1|)) (fp.eq |c_ULTIMATE.start_main_~main__x~0#1| ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))))) is different from true [2021-12-17 07:17:36,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 07:17:36,037 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2021-12-17 07:17:36,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-17 07:17:36,038 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-12-17 07:17:36,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 07:17:36,038 INFO L225 Difference]: With dead ends: 12 [2021-12-17 07:17:36,038 INFO L226 Difference]: Without dead ends: 9 [2021-12-17 07:17:36,039 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 31.6s TimeCoverageRelationStatistics Valid=27, Invalid=20, Unknown=13, NotChecked=150, Total=210 [2021-12-17 07:17:36,040 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 27 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 07:17:36,040 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 10 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 27 Unchecked, 0.1s Time] [2021-12-17 07:17:36,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2021-12-17 07:17:36,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2021-12-17 07:17:36,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 07:17:36,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2021-12-17 07:17:36,042 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2021-12-17 07:17:36,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 07:17:36,042 INFO L470 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2021-12-17 07:17:36,042 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 07:17:36,042 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2021-12-17 07:17:36,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-12-17 07:17:36,043 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 07:17:36,043 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1] [2021-12-17 07:17:36,094 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-12-17 07:17:36,249 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 07:17:36,250 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 07:17:36,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 07:17:36,251 INFO L85 PathProgramCache]: Analyzing trace with hash 145055718, now seen corresponding path program 3 times [2021-12-17 07:17:36,251 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 07:17:36,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1257488626] [2021-12-17 07:17:36,251 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-17 07:17:36,251 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 07:17:36,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 07:17:36,253 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 07:17:36,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-12-17 07:17:39,344 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-12-17 07:17:39,345 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 07:17:39,494 INFO L263 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-17 07:17:39,495 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 07:17:49,772 WARN L227 SmtUtils]: Spent 5.17s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 07:17:55,007 WARN L227 SmtUtils]: Spent 5.21s on a formula simplification that was a NOOP. DAG size: 3 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-17 07:17:57,383 WARN L860 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (= |c_ULTIMATE.start_main_~main__x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))))) is different from true [2021-12-17 07:18:03,265 WARN L227 SmtUtils]: Spent 5.84s on a formula simplification that was a NOOP. DAG size: 3 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-17 07:18:05,790 WARN L860 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~main__x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) .cse0)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-12-17 07:18:16,961 WARN L227 SmtUtils]: Spent 6.53s on a formula simplification that was a NOOP. DAG size: 3 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-17 07:18:19,745 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (and (= |c_ULTIMATE.start_main_~main__x~0#1| ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven) (= |c_ULTIMATE.start_main_~main__x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x~0#1|) .cse0))))) is different from false [2021-12-17 07:18:22,428 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (and (= |c_ULTIMATE.start_main_~main__x~0#1| ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven) (= |c_ULTIMATE.start_main_~main__x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x~0#1|) .cse0))))) is different from true [2021-12-17 07:18:22,517 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2021-12-17 07:18:22,517 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 07:18:33,404 WARN L838 $PredicateComparison]: unable to prove that (or (fp.eq |c_ULTIMATE.start_main_~main__x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1|) ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) |c_ULTIMATE.start_main_~main__x1~0#1|))) is different from false [2021-12-17 07:18:35,583 WARN L860 $PredicateComparison]: unable to prove that (or (fp.eq |c_ULTIMATE.start_main_~main__x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1|) ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) |c_ULTIMATE.start_main_~main__x1~0#1|))) is different from true [2021-12-17 07:18:40,621 WARN L227 SmtUtils]: Spent 5.03s on a formula simplification that was a NOOP. DAG size: 12 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-17 07:18:45,938 WARN L227 SmtUtils]: Spent 5.32s on a formula simplification that was a NOOP. DAG size: 10 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-17 07:18:48,294 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1|) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))))) is different from false [2021-12-17 07:18:50,654 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1|) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))))) is different from true [2021-12-17 07:18:56,652 WARN L227 SmtUtils]: Spent 5.99s on a formula simplification that was a NOOP. DAG size: 13 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-17 07:19:02,328 WARN L227 SmtUtils]: Spent 5.68s on a formula simplification that was a NOOP. DAG size: 15 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-17 07:19:04,859 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1|) .cse1))) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0))))) is different from false [2021-12-17 07:19:07,418 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1|) .cse1))) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0))))) is different from true [2021-12-17 07:19:13,979 WARN L227 SmtUtils]: Spent 6.56s on a formula simplification that was a NOOP. DAG size: 18 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-17 07:19:20,298 WARN L227 SmtUtils]: Spent 6.31s on a formula simplification that was a NOOP. DAG size: 20 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-17 07:19:22,968 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1))) .cse1))) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0))))) is different from false [2021-12-17 07:19:25,655 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1))) .cse1))) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0))))) is different from true [2021-12-17 07:19:25,655 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2021-12-17 07:19:25,655 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 07:19:25,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1257488626] [2021-12-17 07:19:25,656 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1257488626] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 07:19:25,656 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 07:19:25,656 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 12 [2021-12-17 07:19:25,656 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074110202] [2021-12-17 07:19:25,656 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 07:19:25,656 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-17 07:19:25,656 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 07:19:25,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-17 07:19:25,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=22, Unknown=12, NotChecked=98, Total=156 [2021-12-17 07:19:25,657 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 13 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 07:19:28,456 WARN L860 $PredicateComparison]: unable to prove that (and (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1))) .cse1))) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-12-17 07:19:31,190 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (and (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1|) .cse1))) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) (= |c_ULTIMATE.start_main_~main__x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1))))) is different from true [2021-12-17 07:19:33,949 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (and (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1|) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))))) (= |c_ULTIMATE.start_main_~main__x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1))) .cse1))))) is different from true [2021-12-17 07:19:36,858 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (and (= |c_ULTIMATE.start_main_~main__x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven) (or (fp.eq |c_ULTIMATE.start_main_~main__x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1|) .cse0)) |c_ULTIMATE.start_main_~main__x1~0#1|))))) is different from false [2021-12-17 07:19:39,563 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (and (= |c_ULTIMATE.start_main_~main__x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven) (or (fp.eq |c_ULTIMATE.start_main_~main__x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1|) .cse0)) |c_ULTIMATE.start_main_~main__x1~0#1|))))) is different from true [2021-12-17 07:19:42,329 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (and (= |c_ULTIMATE.start_main_~main__x~0#1| ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven) (= |c_ULTIMATE.start_main_~main__x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x~0#1|) .cse0))) (or (not (fp.eq |c_ULTIMATE.start_main_~main__x1~0#1| |c_ULTIMATE.start_main_~main__x~0#1|)) (fp.eq |c_ULTIMATE.start_main_~main__x~0#1| ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))))) is different from false [2021-12-17 07:19:45,070 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (and (= |c_ULTIMATE.start_main_~main__x~0#1| ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven) (= |c_ULTIMATE.start_main_~main__x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x~0#1|) .cse0))) (or (not (fp.eq |c_ULTIMATE.start_main_~main__x1~0#1| |c_ULTIMATE.start_main_~main__x~0#1|)) (fp.eq |c_ULTIMATE.start_main_~main__x~0#1| ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))))) is different from true [2021-12-17 07:19:45,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 07:19:45,193 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2021-12-17 07:19:45,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-17 07:19:45,194 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-12-17 07:19:45,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 07:19:45,194 INFO L225 Difference]: With dead ends: 13 [2021-12-17 07:19:45,194 INFO L226 Difference]: Without dead ends: 10 [2021-12-17 07:19:45,194 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 56.9s TimeCoverageRelationStatistics Valid=34, Invalid=25, Unknown=19, NotChecked=228, Total=306 [2021-12-17 07:19:45,195 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 32 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-17 07:19:45,196 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 10 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 32 Unchecked, 0.2s Time] [2021-12-17 07:19:45,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2021-12-17 07:19:45,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2021-12-17 07:19:45,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 07:19:45,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2021-12-17 07:19:45,197 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2021-12-17 07:19:45,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 07:19:45,198 INFO L470 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2021-12-17 07:19:45,198 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 07:19:45,198 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2021-12-17 07:19:45,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-17 07:19:45,198 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 07:19:45,198 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1] [2021-12-17 07:19:45,256 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-12-17 07:19:45,407 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 07:19:45,408 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 07:19:45,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 07:19:45,408 INFO L85 PathProgramCache]: Analyzing trace with hash 201697478, now seen corresponding path program 4 times [2021-12-17 07:19:45,409 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 07:19:45,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [354015276] [2021-12-17 07:19:45,409 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-17 07:19:45,409 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 07:19:45,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 07:19:45,410 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 07:19:45,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-12-17 07:19:48,678 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-17 07:19:48,679 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 07:19:48,880 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-17 07:19:48,881 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 07:19:59,548 WARN L227 SmtUtils]: Spent 5.33s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 07:20:04,806 WARN L227 SmtUtils]: Spent 5.25s on a formula simplification that was a NOOP. DAG size: 3 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-17 07:20:07,235 WARN L860 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (= |c_ULTIMATE.start_main_~main__x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))))) is different from true [2021-12-17 07:20:13,228 WARN L227 SmtUtils]: Spent 5.90s on a formula simplification that was a NOOP. DAG size: 3 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-17 07:20:15,786 WARN L860 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~main__x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) .cse0)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-12-17 07:20:22,438 WARN L227 SmtUtils]: Spent 6.65s on a formula simplification that was a NOOP. DAG size: 3 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-17 07:20:25,224 WARN L860 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (= |c_ULTIMATE.start_main_~main__x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) .cse0))) .cse0))))) is different from true [2021-12-17 07:20:31,869 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (and (= |c_ULTIMATE.start_main_~main__x~0#1| ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) .cse0))) .cse0))) .cse0))) .cse0))) (= |c_ULTIMATE.start_main_~main__x1~0#1| ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven |c_ULTIMATE.start_main_~main__x~0#1|) .cse0))))) is different from true [2021-12-17 07:20:31,952 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2021-12-17 07:20:31,952 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 07:20:37,606 WARN L838 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1|) ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) |c_ULTIMATE.start_main_~main__x1~0#1|)) is different from false [2021-12-17 07:20:39,781 WARN L860 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1|) ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) |c_ULTIMATE.start_main_~main__x1~0#1|)) is different from true [2021-12-17 07:20:46,891 WARN L838 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1|) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from false [2021-12-17 07:20:49,265 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1|) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from true [2021-12-17 07:20:54,379 WARN L227 SmtUtils]: Spent 5.11s on a formula simplification that was a NOOP. DAG size: 15 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-17 07:20:56,932 WARN L838 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1|) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from false [2021-12-17 07:20:59,497 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1|) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from true [2021-12-17 07:21:05,014 WARN L227 SmtUtils]: Spent 5.51s on a formula simplification that was a NOOP. DAG size: 18 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-17 07:21:07,786 WARN L838 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1|) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from false [2021-12-17 07:21:10,579 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1|) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from true [2021-12-17 07:21:12,885 WARN L228 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2021-12-17 07:21:12,886 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 07:21:12,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [354015276] [2021-12-17 07:21:12,886 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") [2021-12-17 07:21:12,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [167356383] [2021-12-17 07:21:12,887 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-17 07:21:12,887 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-17 07:21:12,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-17 07:21:12,893 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 101 [2021-12-17 07:21:12,894 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-17 07:21:12,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2021-12-17 07:21:20,666 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-17 07:21:20,666 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 07:21:20,677 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-17 07:21:20,677 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 07:21:20,678 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Connection to SMT solver broken [2021-12-17 07:21:20,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [644552731] [2021-12-17 07:21:20,678 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-17 07:21:20,678 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 07:21:20,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 07:21:20,680 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 07:21:20,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process Killed by 15