./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-benchs/interpolation2.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -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/float-benchs/interpolation2.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 5f3bcf3c30f63fe0ad0702712c01ba8d1145d6fb2558cd3e5ee3c870476dc3b1 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:23:20,165 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:23:20,166 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:23:20,187 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:23:20,188 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:23:20,189 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:23:20,189 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:23:20,191 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:23:20,192 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:23:20,192 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:23:20,193 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:23:20,194 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:23:20,194 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:23:20,195 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:23:20,196 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:23:20,196 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:23:20,197 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:23:20,198 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:23:20,199 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:23:20,200 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:23:20,201 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:23:20,204 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:23:20,205 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:23:20,206 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:23:20,207 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:23:20,208 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:23:20,208 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:23:20,208 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:23:20,209 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:23:20,209 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:23:20,210 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:23:20,210 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:23:20,211 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:23:20,211 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:23:20,212 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:23:20,212 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:23:20,213 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:23:20,213 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:23:20,213 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:23:20,214 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:23:20,214 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:23:20,215 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 16:23:20,228 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:23:20,228 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:23:20,228 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:23:20,228 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:23:20,229 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:23:20,229 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:23:20,229 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:23:20,230 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:23:20,230 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:23:20,230 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:23:20,230 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:23:20,230 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 16:23:20,230 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:23:20,230 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:23:20,230 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:23:20,231 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:23:20,231 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:23:20,231 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:23:20,231 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:23:20,231 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:23:20,231 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:23:20,231 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:23:20,232 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:23:20,232 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:23:20,232 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:23:20,232 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:23:20,232 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:23:20,232 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:23:20,232 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 16:23:20,233 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 16:23:20,233 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:23:20,233 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:23:20,233 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:23:20,233 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 -> 5f3bcf3c30f63fe0ad0702712c01ba8d1145d6fb2558cd3e5ee3c870476dc3b1 [2022-02-20 16:23:20,418 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:23:20,436 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:23:20,438 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:23:20,439 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:23:20,440 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:23:20,441 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/interpolation2.c [2022-02-20 16:23:20,499 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1471fbbc6/81a0d917ec5647b3811ceb1721992c68/FLAGb754df644 [2022-02-20 16:23:20,884 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:23:20,884 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/interpolation2.c [2022-02-20 16:23:20,893 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1471fbbc6/81a0d917ec5647b3811ceb1721992c68/FLAGb754df644 [2022-02-20 16:23:20,905 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1471fbbc6/81a0d917ec5647b3811ceb1721992c68 [2022-02-20 16:23:20,907 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:23:20,909 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:23:20,911 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:23:20,911 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:23:20,913 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:23:20,916 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:23:20" (1/1) ... [2022-02-20 16:23:20,917 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@735ab37f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:23:20, skipping insertion in model container [2022-02-20 16:23:20,917 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:23:20" (1/1) ... [2022-02-20 16:23:20,922 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:23:20,931 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:23:21,104 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/float-benchs/interpolation2.c[450,463] [2022-02-20 16:23:21,134 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:23:21,140 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:23:21,149 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/float-benchs/interpolation2.c[450,463] [2022-02-20 16:23:21,168 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:23:21,176 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:23:21,177 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:23:21 WrapperNode [2022-02-20 16:23:21,177 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:23:21,178 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:23:21,178 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:23:21,178 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:23:21,182 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:23:21" (1/1) ... [2022-02-20 16:23:21,195 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:23:21" (1/1) ... [2022-02-20 16:23:21,214 INFO L137 Inliner]: procedures = 18, calls = 49, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 100 [2022-02-20 16:23:21,214 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:23:21,215 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:23:21,215 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:23:21,215 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:23:21,220 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:23:21" (1/1) ... [2022-02-20 16:23:21,220 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:23:21" (1/1) ... [2022-02-20 16:23:21,223 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:23:21" (1/1) ... [2022-02-20 16:23:21,224 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:23:21" (1/1) ... [2022-02-20 16:23:21,235 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:23:21" (1/1) ... [2022-02-20 16:23:21,237 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:23:21" (1/1) ... [2022-02-20 16:23:21,238 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:23:21" (1/1) ... [2022-02-20 16:23:21,245 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:23:21,246 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:23:21,246 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:23:21,246 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:23:21,246 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:23:21" (1/1) ... [2022-02-20 16:23:21,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:23:21,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:23:21,282 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 16:23:21,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 16:23:21,320 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:23:21,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 16:23:21,320 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:23:21,321 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-02-20 16:23:21,321 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:23:21,321 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:23:21,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2022-02-20 16:23:21,321 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:23:21,386 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:23:21,387 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:23:21,538 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:23:21,541 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:23:21,541 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 16:23:21,542 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:23:21 BoogieIcfgContainer [2022-02-20 16:23:21,543 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:23:21,544 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:23:21,559 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:23:21,561 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:23:21,561 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:23:20" (1/3) ... [2022-02-20 16:23:21,562 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3042efda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:23:21, skipping insertion in model container [2022-02-20 16:23:21,562 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:23:21" (2/3) ... [2022-02-20 16:23:21,562 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3042efda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:23:21, skipping insertion in model container [2022-02-20 16:23:21,562 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:23:21" (3/3) ... [2022-02-20 16:23:21,563 INFO L111 eAbstractionObserver]: Analyzing ICFG interpolation2.c [2022-02-20 16:23:21,566 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:23:21,566 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:23:21,603 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:23:21,623 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 [2022-02-20 16:23:21,624 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:23:21,648 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 16 states have internal predecessors, (22), 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) [2022-02-20 16:23:21,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 16:23:21,651 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:23:21,651 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:23:21,652 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:23:21,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:23:21,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1235833265, now seen corresponding path program 1 times [2022-02-20 16:23:21,660 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:23:21,671 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326791349] [2022-02-20 16:23:21,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:23:21,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:23:21,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:23:21,826 INFO L290 TraceCheckUtils]: 0: Hoare triple {20#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {20#true} is VALID [2022-02-20 16:23:21,827 INFO L290 TraceCheckUtils]: 1: Hoare triple {20#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~short7#1, main_#t~mem9#1, main_#t~post8#1, main_#t~mem14#1, main_#t~mem11#1, main_#t~mem10#1, main_#t~mem12#1, main_#t~mem13#1, main_~i~0#1, main_~z~0#1, main_~t~0#1, main_~#min~0#1.base, main_~#min~0#1.offset, main_~#max~0#1.base, main_~#max~0#1.offset, main_~#org~0#1.base, main_~#org~0#1.offset, main_~#slope~0#1.base, main_~#slope~0#1.offset;havoc main_~i~0#1;havoc main_~z~0#1;havoc main_~t~0#1;call main_~#min~0#1.base, main_~#min~0#1.offset := #Ultimate.allocOnStack(20);call write~init~real(~convertINTToFLOAT(5), main_~#min~0#1.base, main_~#min~0#1.offset, 4);call write~init~real(~convertINTToFLOAT(10), main_~#min~0#1.base, 4 + main_~#min~0#1.offset, 4);call write~init~real(~convertINTToFLOAT(12), main_~#min~0#1.base, 8 + main_~#min~0#1.offset, 4);call write~init~real(~convertINTToFLOAT(30), main_~#min~0#1.base, 12 + main_~#min~0#1.offset, 4);call write~init~real(~convertINTToFLOAT(150), main_~#min~0#1.base, 16 + main_~#min~0#1.offset, 4);call main_~#max~0#1.base, main_~#max~0#1.offset := #Ultimate.allocOnStack(20);call write~init~real(~convertINTToFLOAT(10), main_~#max~0#1.base, main_~#max~0#1.offset, 4);call write~init~real(~convertINTToFLOAT(12), main_~#max~0#1.base, 4 + main_~#max~0#1.offset, 4);call write~init~real(~convertINTToFLOAT(30), main_~#max~0#1.base, 8 + main_~#max~0#1.offset, 4);call write~init~real(~convertINTToFLOAT(150), main_~#max~0#1.base, 12 + main_~#max~0#1.offset, 4);call write~init~real(~convertINTToFLOAT(300), main_~#max~0#1.base, 16 + main_~#max~0#1.offset, 4);call main_~#org~0#1.base, main_~#org~0#1.offset := #Ultimate.allocOnStack(20);call write~init~real(~convertINTToFLOAT(1), main_~#org~0#1.base, main_~#org~0#1.offset, 4);call write~init~real(~convertINTToFLOAT(5), main_~#org~0#1.base, 4 + main_~#org~0#1.offset, 4);call write~init~real(~convertINTToFLOAT(-10), main_~#org~0#1.base, 8 + main_~#org~0#1.offset, 4);call write~init~real(~convertINTToFLOAT(30), main_~#org~0#1.base, 12 + main_~#org~0#1.offset, 4);call write~init~real(~convertINTToFLOAT(20), main_~#org~0#1.base, 16 + main_~#org~0#1.offset, 4);call main_~#slope~0#1.base, main_~#slope~0#1.offset := #Ultimate.allocOnStack(20);call write~init~real(~convertINTToFLOAT(4), main_~#slope~0#1.base, main_~#slope~0#1.offset, 4);call write~init~real(~convertINTToFLOAT(-15), main_~#slope~0#1.base, 4 + main_~#slope~0#1.offset, 4);call write~init~real(~convertINTToFLOAT(40), main_~#slope~0#1.base, 8 + main_~#slope~0#1.offset, 4);call write~init~real(~convertINTToFLOAT(-10), main_~#slope~0#1.base, 12 + main_~#slope~0#1.offset, 4);call write~init~real(~convertINTToFLOAT(0), main_~#slope~0#1.base, 16 + main_~#slope~0#1.offset, 4);main_~t~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;call main_#t~mem5#1 := read~real(main_~#min~0#1.base, main_~#min~0#1.offset, 4);main_#t~short7#1 := ~someBinaryFLOATComparisonOperation(main_~t~0#1, main_#t~mem5#1); {20#true} is VALID [2022-02-20 16:23:21,827 INFO L290 TraceCheckUtils]: 2: Hoare triple {20#true} assume main_#t~short7#1;call main_#t~mem6#1 := read~real(main_~#max~0#1.base, 16 + main_~#max~0#1.offset, 4);main_#t~short7#1 := ~someBinaryFLOATComparisonOperation(main_~t~0#1, main_#t~mem6#1); {20#true} is VALID [2022-02-20 16:23:21,828 INFO L290 TraceCheckUtils]: 3: Hoare triple {20#true} assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_#t~short7#1 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {20#true} is VALID [2022-02-20 16:23:21,829 INFO L290 TraceCheckUtils]: 4: Hoare triple {20#true} assume 0 == assume_abort_if_not_~cond#1;assume false; {21#false} is VALID [2022-02-20 16:23:21,829 INFO L290 TraceCheckUtils]: 5: Hoare triple {21#false} assume { :end_inline_assume_abort_if_not } true;havoc main_#t~mem5#1;havoc main_#t~mem6#1;havoc main_#t~short7#1;main_~i~0#1 := 0; {21#false} is VALID [2022-02-20 16:23:21,830 INFO L290 TraceCheckUtils]: 6: Hoare triple {21#false} assume !true; {21#false} is VALID [2022-02-20 16:23:21,830 INFO L290 TraceCheckUtils]: 7: Hoare triple {21#false} call main_#t~mem14#1 := read~real(main_~#org~0#1.base, main_~#org~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem11#1 := read~real(main_~#slope~0#1.base, main_~#slope~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem10#1 := read~real(main_~#min~0#1.base, main_~#min~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem12#1 := read~real(main_~#max~0#1.base, main_~#max~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem13#1 := read~real(main_~#min~0#1.base, main_~#min~0#1.offset + 4 * main_~i~0#1, 4);main_~z~0#1 := ~someBinaryArithmeticFLOAToperation(main_#t~mem14#1, ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(main_#t~mem11#1, ~someBinaryArithmeticFLOAToperation(main_~t~0#1, main_#t~mem10#1)), ~someBinaryArithmeticFLOAToperation(main_#t~mem12#1, main_#t~mem13#1)));havoc main_#t~mem14#1;havoc main_#t~mem11#1;havoc main_#t~mem10#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if ~someBinaryFLOATComparisonOperation(main_~z~0#1, ~someUnaryFLOAToperation(10.0)) && ~someBinaryFLOATComparisonOperation(main_~z~0#1, 30.0) then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {21#false} is VALID [2022-02-20 16:23:21,830 INFO L290 TraceCheckUtils]: 8: Hoare triple {21#false} assume 0 == __VERIFIER_assert_~cond#1; {21#false} is VALID [2022-02-20 16:23:21,833 INFO L290 TraceCheckUtils]: 9: Hoare triple {21#false} assume !false; {21#false} is VALID [2022-02-20 16:23:21,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:23:21,834 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:23:21,835 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326791349] [2022-02-20 16:23:21,836 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326791349] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:23:21,836 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:23:21,837 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:23:21,838 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911626962] [2022-02-20 16:23:21,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:23:21,842 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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 10 [2022-02-20 16:23:21,843 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:23:21,845 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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) [2022-02-20 16:23:21,866 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:23:21,867 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:23:21,867 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:23:21,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:23:21,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:23:21,886 INFO L87 Difference]: Start difference. First operand has 17 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 16 states have internal predecessors, (22), 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 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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) [2022-02-20 16:23:21,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:23:21,914 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2022-02-20 16:23:21,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:23:21,915 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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 10 [2022-02-20 16:23:21,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:23:21,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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) [2022-02-20 16:23:21,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 37 transitions. [2022-02-20 16:23:21,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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) [2022-02-20 16:23:21,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 37 transitions. [2022-02-20 16:23:21,922 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 37 transitions. [2022-02-20 16:23:21,957 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:23:21,962 INFO L225 Difference]: With dead ends: 29 [2022-02-20 16:23:21,962 INFO L226 Difference]: Without dead ends: 13 [2022-02-20 16:23:21,964 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:23:21,967 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:23:21,968 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:23:21,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-02-20 16:23:21,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-02-20 16:23:21,985 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:23:21,985 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand has 13 states, 12 states have (on average 1.25) 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) [2022-02-20 16:23:21,986 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand has 13 states, 12 states have (on average 1.25) 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) [2022-02-20 16:23:21,986 INFO L87 Difference]: Start difference. First operand 13 states. Second operand has 13 states, 12 states have (on average 1.25) 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) [2022-02-20 16:23:21,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:23:21,990 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2022-02-20 16:23:21,990 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2022-02-20 16:23:21,991 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:23:21,991 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:23:21,992 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 12 states have (on average 1.25) 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) Second operand 13 states. [2022-02-20 16:23:21,992 INFO L87 Difference]: Start difference. First operand has 13 states, 12 states have (on average 1.25) 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) Second operand 13 states. [2022-02-20 16:23:21,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:23:21,997 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2022-02-20 16:23:21,997 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2022-02-20 16:23:21,997 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:23:21,997 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:23:21,998 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:23:21,998 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:23:21,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.25) 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) [2022-02-20 16:23:22,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2022-02-20 16:23:22,001 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 10 [2022-02-20 16:23:22,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:23:22,001 INFO L470 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2022-02-20 16:23:22,002 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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) [2022-02-20 16:23:22,002 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2022-02-20 16:23:22,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 16:23:22,003 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:23:22,003 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:23:22,003 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 16:23:22,004 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:23:22,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:23:22,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1178902664, now seen corresponding path program 1 times [2022-02-20 16:23:22,008 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:23:22,008 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102604337] [2022-02-20 16:23:22,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:23:22,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:23:22,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:23:22,098 INFO L290 TraceCheckUtils]: 0: Hoare triple {99#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {99#true} is VALID [2022-02-20 16:23:22,099 INFO L290 TraceCheckUtils]: 1: Hoare triple {99#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~short7#1, main_#t~mem9#1, main_#t~post8#1, main_#t~mem14#1, main_#t~mem11#1, main_#t~mem10#1, main_#t~mem12#1, main_#t~mem13#1, main_~i~0#1, main_~z~0#1, main_~t~0#1, main_~#min~0#1.base, main_~#min~0#1.offset, main_~#max~0#1.base, main_~#max~0#1.offset, main_~#org~0#1.base, main_~#org~0#1.offset, main_~#slope~0#1.base, main_~#slope~0#1.offset;havoc main_~i~0#1;havoc main_~z~0#1;havoc main_~t~0#1;call main_~#min~0#1.base, main_~#min~0#1.offset := #Ultimate.allocOnStack(20);call write~init~real(~convertINTToFLOAT(5), main_~#min~0#1.base, main_~#min~0#1.offset, 4);call write~init~real(~convertINTToFLOAT(10), main_~#min~0#1.base, 4 + main_~#min~0#1.offset, 4);call write~init~real(~convertINTToFLOAT(12), main_~#min~0#1.base, 8 + main_~#min~0#1.offset, 4);call write~init~real(~convertINTToFLOAT(30), main_~#min~0#1.base, 12 + main_~#min~0#1.offset, 4);call write~init~real(~convertINTToFLOAT(150), main_~#min~0#1.base, 16 + main_~#min~0#1.offset, 4);call main_~#max~0#1.base, main_~#max~0#1.offset := #Ultimate.allocOnStack(20);call write~init~real(~convertINTToFLOAT(10), main_~#max~0#1.base, main_~#max~0#1.offset, 4);call write~init~real(~convertINTToFLOAT(12), main_~#max~0#1.base, 4 + main_~#max~0#1.offset, 4);call write~init~real(~convertINTToFLOAT(30), main_~#max~0#1.base, 8 + main_~#max~0#1.offset, 4);call write~init~real(~convertINTToFLOAT(150), main_~#max~0#1.base, 12 + main_~#max~0#1.offset, 4);call write~init~real(~convertINTToFLOAT(300), main_~#max~0#1.base, 16 + main_~#max~0#1.offset, 4);call main_~#org~0#1.base, main_~#org~0#1.offset := #Ultimate.allocOnStack(20);call write~init~real(~convertINTToFLOAT(1), main_~#org~0#1.base, main_~#org~0#1.offset, 4);call write~init~real(~convertINTToFLOAT(5), main_~#org~0#1.base, 4 + main_~#org~0#1.offset, 4);call write~init~real(~convertINTToFLOAT(-10), main_~#org~0#1.base, 8 + main_~#org~0#1.offset, 4);call write~init~real(~convertINTToFLOAT(30), main_~#org~0#1.base, 12 + main_~#org~0#1.offset, 4);call write~init~real(~convertINTToFLOAT(20), main_~#org~0#1.base, 16 + main_~#org~0#1.offset, 4);call main_~#slope~0#1.base, main_~#slope~0#1.offset := #Ultimate.allocOnStack(20);call write~init~real(~convertINTToFLOAT(4), main_~#slope~0#1.base, main_~#slope~0#1.offset, 4);call write~init~real(~convertINTToFLOAT(-15), main_~#slope~0#1.base, 4 + main_~#slope~0#1.offset, 4);call write~init~real(~convertINTToFLOAT(40), main_~#slope~0#1.base, 8 + main_~#slope~0#1.offset, 4);call write~init~real(~convertINTToFLOAT(-10), main_~#slope~0#1.base, 12 + main_~#slope~0#1.offset, 4);call write~init~real(~convertINTToFLOAT(0), main_~#slope~0#1.base, 16 + main_~#slope~0#1.offset, 4);main_~t~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;call main_#t~mem5#1 := read~real(main_~#min~0#1.base, main_~#min~0#1.offset, 4);main_#t~short7#1 := ~someBinaryFLOATComparisonOperation(main_~t~0#1, main_#t~mem5#1); {99#true} is VALID [2022-02-20 16:23:22,099 INFO L290 TraceCheckUtils]: 2: Hoare triple {99#true} assume main_#t~short7#1;call main_#t~mem6#1 := read~real(main_~#max~0#1.base, 16 + main_~#max~0#1.offset, 4);main_#t~short7#1 := ~someBinaryFLOATComparisonOperation(main_~t~0#1, main_#t~mem6#1); {99#true} is VALID [2022-02-20 16:23:22,104 INFO L290 TraceCheckUtils]: 3: Hoare triple {99#true} assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_#t~short7#1 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {99#true} is VALID [2022-02-20 16:23:22,105 INFO L290 TraceCheckUtils]: 4: Hoare triple {99#true} assume !(0 == assume_abort_if_not_~cond#1); {99#true} is VALID [2022-02-20 16:23:22,105 INFO L290 TraceCheckUtils]: 5: Hoare triple {99#true} assume { :end_inline_assume_abort_if_not } true;havoc main_#t~mem5#1;havoc main_#t~mem6#1;havoc main_#t~short7#1;main_~i~0#1 := 0; {101#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 16:23:22,106 INFO L290 TraceCheckUtils]: 6: Hoare triple {101#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_~i~0#1 % 4294967296 < 5); {100#false} is VALID [2022-02-20 16:23:22,106 INFO L290 TraceCheckUtils]: 7: Hoare triple {100#false} call main_#t~mem14#1 := read~real(main_~#org~0#1.base, main_~#org~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem11#1 := read~real(main_~#slope~0#1.base, main_~#slope~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem10#1 := read~real(main_~#min~0#1.base, main_~#min~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem12#1 := read~real(main_~#max~0#1.base, main_~#max~0#1.offset + 4 * main_~i~0#1, 4);call main_#t~mem13#1 := read~real(main_~#min~0#1.base, main_~#min~0#1.offset + 4 * main_~i~0#1, 4);main_~z~0#1 := ~someBinaryArithmeticFLOAToperation(main_#t~mem14#1, ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(main_#t~mem11#1, ~someBinaryArithmeticFLOAToperation(main_~t~0#1, main_#t~mem10#1)), ~someBinaryArithmeticFLOAToperation(main_#t~mem12#1, main_#t~mem13#1)));havoc main_#t~mem14#1;havoc main_#t~mem11#1;havoc main_#t~mem10#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if ~someBinaryFLOATComparisonOperation(main_~z~0#1, ~someUnaryFLOAToperation(10.0)) && ~someBinaryFLOATComparisonOperation(main_~z~0#1, 30.0) then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {100#false} is VALID [2022-02-20 16:23:22,107 INFO L290 TraceCheckUtils]: 8: Hoare triple {100#false} assume 0 == __VERIFIER_assert_~cond#1; {100#false} is VALID [2022-02-20 16:23:22,107 INFO L290 TraceCheckUtils]: 9: Hoare triple {100#false} assume !false; {100#false} is VALID [2022-02-20 16:23:22,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:23:22,126 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:23:22,126 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102604337] [2022-02-20 16:23:22,127 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102604337] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:23:22,127 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:23:22,127 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 16:23:22,127 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58789269] [2022-02-20 16:23:22,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:23:22,128 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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 10 [2022-02-20 16:23:22,129 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:23:22,129 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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) [2022-02-20 16:23:22,141 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:23:22,141 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 16:23:22,141 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:23:22,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 16:23:22,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:23:22,142 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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) [2022-02-20 16:23:22,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:23:22,167 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-02-20 16:23:22,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 16:23:22,167 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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 10 [2022-02-20 16:23:22,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:23:22,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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) [2022-02-20 16:23:22,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2022-02-20 16:23:22,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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) [2022-02-20 16:23:22,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2022-02-20 16:23:22,170 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 26 transitions. [2022-02-20 16:23:22,193 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:23:22,195 INFO L225 Difference]: With dead ends: 24 [2022-02-20 16:23:22,195 INFO L226 Difference]: Without dead ends: 20 [2022-02-20 16:23:22,199 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:23:22,200 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 6 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:23:22,201 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 23 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:23:22,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-02-20 16:23:22,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 14. [2022-02-20 16:23:22,206 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:23:22,206 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 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) [2022-02-20 16:23:22,206 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 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) [2022-02-20 16:23:22,207 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 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) [2022-02-20 16:23:22,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:23:22,209 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2022-02-20 16:23:22,209 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-02-20 16:23:22,209 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:23:22,209 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:23:22,210 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 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 20 states. [2022-02-20 16:23:22,210 INFO L87 Difference]: Start difference. First operand has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 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 20 states. [2022-02-20 16:23:22,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:23:22,211 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2022-02-20 16:23:22,211 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-02-20 16:23:22,212 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:23:22,212 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:23:22,212 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:23:22,212 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:23:22,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 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) [2022-02-20 16:23:22,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2022-02-20 16:23:22,214 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 10 [2022-02-20 16:23:22,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:23:22,215 INFO L470 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2022-02-20 16:23:22,215 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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) [2022-02-20 16:23:22,215 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2022-02-20 16:23:22,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 16:23:22,216 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:23:22,216 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:23:22,216 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 16:23:22,216 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:23:22,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:23:22,217 INFO L85 PathProgramCache]: Analyzing trace with hash 2110328889, now seen corresponding path program 1 times [2022-02-20 16:23:22,217 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:23:22,217 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584069416] [2022-02-20 16:23:22,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:23:22,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:23:22,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:23:22,266 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 16:23:22,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:23:22,299 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 16:23:22,299 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 16:23:22,300 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 16:23:22,301 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 16:23:22,303 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-02-20 16:23:22,304 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:23:22,330 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 16:23:22,330 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 16:23:22,330 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2022-02-20 16:23:22,330 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2022-02-20 16:23:22,331 WARN L170 areAnnotationChecker]: L21-2 has no Hoare annotation [2022-02-20 16:23:22,331 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-02-20 16:23:22,331 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-02-20 16:23:22,331 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-02-20 16:23:22,331 WARN L170 areAnnotationChecker]: L23-3 has no Hoare annotation [2022-02-20 16:23:22,331 WARN L170 areAnnotationChecker]: L23-3 has no Hoare annotation [2022-02-20 16:23:22,331 WARN L170 areAnnotationChecker]: L23-3 has no Hoare annotation [2022-02-20 16:23:22,331 WARN L170 areAnnotationChecker]: L23-4 has no Hoare annotation [2022-02-20 16:23:22,331 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2022-02-20 16:23:22,331 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2022-02-20 16:23:22,332 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-02-20 16:23:22,332 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-02-20 16:23:22,332 WARN L170 areAnnotationChecker]: L23-2 has no Hoare annotation [2022-02-20 16:23:22,332 WARN L170 areAnnotationChecker]: L9-1 has no Hoare annotation [2022-02-20 16:23:22,332 WARN L170 areAnnotationChecker]: L9-1 has no Hoare annotation [2022-02-20 16:23:22,332 WARN L170 areAnnotationChecker]: L9-3 has no Hoare annotation [2022-02-20 16:23:22,332 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-02-20 16:23:22,332 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:23:22,332 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-20 16:23:22,333 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 04:23:22 BoogieIcfgContainer [2022-02-20 16:23:22,333 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 16:23:22,334 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 16:23:22,334 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 16:23:22,334 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 16:23:22,334 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:23:21" (3/4) ... [2022-02-20 16:23:22,336 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-20 16:23:22,336 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 16:23:22,339 INFO L158 Benchmark]: Toolchain (without parser) took 1430.37ms. Allocated memory is still 136.3MB. Free memory was 102.0MB in the beginning and 95.0MB in the end (delta: 7.1MB). Peak memory consumption was 8.0MB. Max. memory is 16.1GB. [2022-02-20 16:23:22,339 INFO L158 Benchmark]: CDTParser took 3.52ms. Allocated memory is still 77.6MB. Free memory was 35.2MB in the beginning and 35.1MB in the end (delta: 40.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:23:22,340 INFO L158 Benchmark]: CACSL2BoogieTranslator took 265.83ms. Allocated memory is still 136.3MB. Free memory was 102.0MB in the beginning and 109.5MB in the end (delta: -7.5MB). Peak memory consumption was 9.5MB. Max. memory is 16.1GB. [2022-02-20 16:23:22,341 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.71ms. Allocated memory is still 136.3MB. Free memory was 109.5MB in the beginning and 107.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:23:22,343 INFO L158 Benchmark]: Boogie Preprocessor took 30.05ms. Allocated memory is still 136.3MB. Free memory was 107.4MB in the beginning and 105.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:23:22,343 INFO L158 Benchmark]: RCFGBuilder took 297.15ms. Allocated memory is still 136.3MB. Free memory was 105.7MB in the beginning and 92.3MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-20 16:23:22,343 INFO L158 Benchmark]: TraceAbstraction took 789.21ms. Allocated memory is still 136.3MB. Free memory was 92.0MB in the beginning and 95.6MB in the end (delta: -3.6MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:23:22,344 INFO L158 Benchmark]: Witness Printer took 4.81ms. Allocated memory is still 136.3MB. Free memory was 95.6MB in the beginning and 95.0MB in the end (delta: 650.0kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:23:22,345 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 3.52ms. Allocated memory is still 77.6MB. Free memory was 35.2MB in the beginning and 35.1MB in the end (delta: 40.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 265.83ms. Allocated memory is still 136.3MB. Free memory was 102.0MB in the beginning and 109.5MB in the end (delta: -7.5MB). Peak memory consumption was 9.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.71ms. Allocated memory is still 136.3MB. Free memory was 109.5MB in the beginning and 107.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.05ms. Allocated memory is still 136.3MB. Free memory was 107.4MB in the beginning and 105.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 297.15ms. Allocated memory is still 136.3MB. Free memory was 105.7MB in the beginning and 92.3MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 789.21ms. Allocated memory is still 136.3MB. Free memory was 92.0MB in the beginning and 95.6MB in the end (delta: -3.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.81ms. Allocated memory is still 136.3MB. Free memory was 95.6MB in the beginning and 95.0MB in the end (delta: 650.0kB). Peak memory consumption was 2.1MB. 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: 9]: 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 28, overapproximation of to_real at line 15, overapproximation of someBinaryArithmeticFLOAToperation at line 26. Possible FailurePath: [L13] int i; [L14] float z, t; [L15] float min[] = { 5, 10, 12, 30, 150 }; [L16] float max[] = { 10, 12, 30, 150, 300 }; [L17] float org[] = { 1, 5, -10, 30, 20 }; [L18] float slope[] = { 4, -15, 40, -10, 0 }; [L20] t = __VERIFIER_nondet_float() [L21] EXPR min[0] [L21] EXPR t >= min[0] && t <= max[sizeof(max) / sizeof(max[0]) - 1] [L21] EXPR max[sizeof(max) / sizeof(max[0]) - 1] [L21] EXPR t >= min[0] && t <= max[sizeof(max) / sizeof(max[0]) - 1] VAL [max={7:0}, max[sizeof(max) / sizeof(max[0]) - 1]=51, min={5:0}, min[0]=50, org={4:0}, slope={6:0}] [L21] CALL assume_abort_if_not(t >= min[0] && t <= max[sizeof(max) / sizeof(max[0]) - 1]) [L7] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L21] RET assume_abort_if_not(t >= min[0] && t <= max[sizeof(max) / sizeof(max[0]) - 1]) [L23] i = 0 VAL [i=0, max={7:0}, min={5:0}, org={4:0}, slope={6:0}] [L23] COND TRUE i < sizeof(min) / sizeof(min[0]) [L24] EXPR max[i] VAL [i=0, max={7:0}, max[i]=49, min={5:0}, org={4:0}, slope={6:0}] [L24] COND TRUE t <= max[i] [L26] EXPR org[i] [L26] EXPR slope[i] [L26] EXPR min[i] [L26] EXPR max[i] [L26] EXPR min[i] [L26] z = org[i] + slope[i] * (t - min[i]) / (max[i] - min[i]) [L28] CALL __VERIFIER_assert(z >= -10.f && z <= 30.f) [L9] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L9] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 17 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.7s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6 mSDsluCounter, 42 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6 IncrementalHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 32 mSDtfsCounter, 6 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17occurred in iteration=0, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 6 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 31 NumberOfCodeBlocks, 31 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 18 ConstructedInterpolants, 0 QuantifiedInterpolants, 20 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-02-20 16:23:22,376 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -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/float-benchs/interpolation2.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 5f3bcf3c30f63fe0ad0702712c01ba8d1145d6fb2558cd3e5ee3c870476dc3b1 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:23:24,206 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:23:24,207 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:23:24,233 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:23:24,236 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:23:24,238 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:23:24,239 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:23:24,243 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:23:24,245 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:23:24,248 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:23:24,249 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:23:24,251 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:23:24,252 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:23:24,253 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:23:24,254 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:23:24,255 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:23:24,256 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:23:24,256 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:23:24,259 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:23:24,263 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:23:24,264 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:23:24,265 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:23:24,265 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:23:24,267 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:23:24,271 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:23:24,271 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:23:24,272 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:23:24,272 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:23:24,273 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:23:24,273 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:23:24,274 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:23:24,274 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:23:24,275 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:23:24,276 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:23:24,276 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:23:24,277 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:23:24,277 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:23:24,277 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:23:24,277 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:23:24,278 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:23:24,279 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:23:24,279 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-02-20 16:23:24,305 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:23:24,306 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:23:24,306 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:23:24,306 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:23:24,307 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:23:24,307 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:23:24,308 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:23:24,308 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:23:24,309 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:23:24,309 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:23:24,309 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:23:24,310 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:23:24,310 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:23:24,310 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:23:24,310 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:23:24,310 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:23:24,310 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 16:23:24,310 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 16:23:24,311 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 16:23:24,311 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:23:24,311 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:23:24,311 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:23:24,311 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:23:24,311 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:23:24,312 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:23:24,312 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:23:24,312 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:23:24,312 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:23:24,312 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:23:24,312 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:23:24,313 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 16:23:24,313 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 16:23:24,313 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:23:24,313 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:23:24,313 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:23:24,313 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 16:23:24,314 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 -> 5f3bcf3c30f63fe0ad0702712c01ba8d1145d6fb2558cd3e5ee3c870476dc3b1 [2022-02-20 16:23:24,559 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:23:24,577 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:23:24,579 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:23:24,579 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:23:24,580 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:23:24,581 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/interpolation2.c [2022-02-20 16:23:24,620 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa3fe36af/83fff128e3604e45a066c6f9254e85f4/FLAG203b37892 [2022-02-20 16:23:24,926 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:23:24,926 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/interpolation2.c [2022-02-20 16:23:24,930 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa3fe36af/83fff128e3604e45a066c6f9254e85f4/FLAG203b37892 [2022-02-20 16:23:25,370 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa3fe36af/83fff128e3604e45a066c6f9254e85f4 [2022-02-20 16:23:25,372 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:23:25,374 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:23:25,376 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:23:25,376 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:23:25,379 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:23:25,379 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:23:25" (1/1) ... [2022-02-20 16:23:25,380 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@453c78b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:23:25, skipping insertion in model container [2022-02-20 16:23:25,381 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:23:25" (1/1) ... [2022-02-20 16:23:25,388 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:23:25,396 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:23:25,486 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/float-benchs/interpolation2.c[450,463] [2022-02-20 16:23:25,517 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:23:25,523 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:23:25,570 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/float-benchs/interpolation2.c[450,463] [2022-02-20 16:23:25,598 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:23:25,608 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:23:25,609 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:23:25 WrapperNode [2022-02-20 16:23:25,609 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:23:25,610 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:23:25,610 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:23:25,610 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:23:25,615 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:23:25" (1/1) ... [2022-02-20 16:23:25,629 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:23:25" (1/1) ... [2022-02-20 16:23:25,672 INFO L137 Inliner]: procedures = 19, calls = 49, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 101 [2022-02-20 16:23:25,673 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:23:25,673 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:23:25,673 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:23:25,674 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:23:25,681 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:23:25" (1/1) ... [2022-02-20 16:23:25,682 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:23:25" (1/1) ... [2022-02-20 16:23:25,691 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:23:25" (1/1) ... [2022-02-20 16:23:25,691 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:23:25" (1/1) ... [2022-02-20 16:23:25,710 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:23:25" (1/1) ... [2022-02-20 16:23:25,712 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:23:25" (1/1) ... [2022-02-20 16:23:25,713 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:23:25" (1/1) ... [2022-02-20 16:23:25,715 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:23:25,716 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:23:25,716 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:23:25,716 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:23:25,716 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:23:25" (1/1) ... [2022-02-20 16:23:25,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:23:25,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:23:25,755 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 16:23:25,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 16:23:25,777 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:23:25,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4 [2022-02-20 16:23:25,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 16:23:25,777 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:23:25,777 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2022-02-20 16:23:25,778 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:23:25,778 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:23:25,778 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:23:25,821 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:23:25,822 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:23:28,231 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:23:28,235 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:23:28,235 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 16:23:28,236 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:23:28 BoogieIcfgContainer [2022-02-20 16:23:28,237 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:23:28,238 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:23:28,238 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:23:28,240 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:23:28,240 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:23:25" (1/3) ... [2022-02-20 16:23:28,240 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@340875d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:23:28, skipping insertion in model container [2022-02-20 16:23:28,241 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:23:25" (2/3) ... [2022-02-20 16:23:28,241 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@340875d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:23:28, skipping insertion in model container [2022-02-20 16:23:28,241 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:23:28" (3/3) ... [2022-02-20 16:23:28,242 INFO L111 eAbstractionObserver]: Analyzing ICFG interpolation2.c [2022-02-20 16:23:28,245 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:23:28,245 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:23:28,275 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:23:28,288 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 [2022-02-20 16:23:28,289 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:23:28,299 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 16 states have internal predecessors, (22), 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) [2022-02-20 16:23:28,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 16:23:28,302 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:23:28,303 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:23:28,303 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:23:28,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:23:28,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1235833265, now seen corresponding path program 1 times [2022-02-20 16:23:28,321 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:23:28,322 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2060605959] [2022-02-20 16:23:28,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:23:28,323 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:23:28,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:23:28,325 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:23:28,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-02-20 16:23:28,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:23:28,657 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-20 16:23:28,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:23:28,670 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:23:28,732 INFO L290 TraceCheckUtils]: 0: Hoare triple {20#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(17bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {20#true} is VALID [2022-02-20 16:23:28,733 INFO L290 TraceCheckUtils]: 1: Hoare triple {20#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~short7#1, main_#t~mem9#1, main_#t~post8#1, main_#t~mem14#1, main_#t~mem11#1, main_#t~mem10#1, main_#t~mem12#1, main_#t~mem13#1, main_~i~0#1, main_~z~0#1, main_~t~0#1, main_~#min~0#1.base, main_~#min~0#1.offset, main_~#max~0#1.base, main_~#max~0#1.offset, main_~#org~0#1.base, main_~#org~0#1.offset, main_~#slope~0#1.base, main_~#slope~0#1.offset;havoc main_~i~0#1;havoc main_~z~0#1;havoc main_~t~0#1;call main_~#min~0#1.base, main_~#min~0#1.offset := #Ultimate.allocOnStack(20bv32);call write~init~intFLOATTYPE4(~convertINTToFLOAT(currentRoundingMode, 5bv32), main_~#min~0#1.base, main_~#min~0#1.offset, 4bv32);call write~init~intFLOATTYPE4(~convertINTToFLOAT(currentRoundingMode, 10bv32), main_~#min~0#1.base, ~bvadd32(4bv32, main_~#min~0#1.offset), 4bv32);call write~init~intFLOATTYPE4(~convertINTToFLOAT(currentRoundingMode, 12bv32), main_~#min~0#1.base, ~bvadd32(8bv32, main_~#min~0#1.offset), 4bv32);call write~init~intFLOATTYPE4(~convertINTToFLOAT(currentRoundingMode, 30bv32), main_~#min~0#1.base, ~bvadd32(12bv32, main_~#min~0#1.offset), 4bv32);call write~init~intFLOATTYPE4(~convertINTToFLOAT(currentRoundingMode, 150bv32), main_~#min~0#1.base, ~bvadd32(16bv32, main_~#min~0#1.offset), 4bv32);call main_~#max~0#1.base, main_~#max~0#1.offset := #Ultimate.allocOnStack(20bv32);call write~init~intFLOATTYPE4(~convertINTToFLOAT(currentRoundingMode, 10bv32), main_~#max~0#1.base, main_~#max~0#1.offset, 4bv32);call write~init~intFLOATTYPE4(~convertINTToFLOAT(currentRoundingMode, 12bv32), main_~#max~0#1.base, ~bvadd32(4bv32, main_~#max~0#1.offset), 4bv32);call write~init~intFLOATTYPE4(~convertINTToFLOAT(currentRoundingMode, 30bv32), main_~#max~0#1.base, ~bvadd32(8bv32, main_~#max~0#1.offset), 4bv32);call write~init~intFLOATTYPE4(~convertINTToFLOAT(currentRoundingMode, 150bv32), main_~#max~0#1.base, ~bvadd32(12bv32, main_~#max~0#1.offset), 4bv32);call write~init~intFLOATTYPE4(~convertINTToFLOAT(currentRoundingMode, 300bv32), main_~#max~0#1.base, ~bvadd32(16bv32, main_~#max~0#1.offset), 4bv32);call main_~#org~0#1.base, main_~#org~0#1.offset := #Ultimate.allocOnStack(20bv32);call write~init~intFLOATTYPE4(~convertINTToFLOAT(currentRoundingMode, 1bv32), main_~#org~0#1.base, main_~#org~0#1.offset, 4bv32);call write~init~intFLOATTYPE4(~convertINTToFLOAT(currentRoundingMode, 5bv32), main_~#org~0#1.base, ~bvadd32(4bv32, main_~#org~0#1.offset), 4bv32);call write~init~intFLOATTYPE4(~convertINTToFLOAT(currentRoundingMode, 4294967286bv32), main_~#org~0#1.base, ~bvadd32(8bv32, main_~#org~0#1.offset), 4bv32);call write~init~intFLOATTYPE4(~convertINTToFLOAT(currentRoundingMode, 30bv32), main_~#org~0#1.base, ~bvadd32(12bv32, main_~#org~0#1.offset), 4bv32);call write~init~intFLOATTYPE4(~convertINTToFLOAT(currentRoundingMode, 20bv32), main_~#org~0#1.base, ~bvadd32(16bv32, main_~#org~0#1.offset), 4bv32);call main_~#slope~0#1.base, main_~#slope~0#1.offset := #Ultimate.allocOnStack(20bv32);call write~init~intFLOATTYPE4(~convertINTToFLOAT(currentRoundingMode, 4bv32), main_~#slope~0#1.base, main_~#slope~0#1.offset, 4bv32);call write~init~intFLOATTYPE4(~convertINTToFLOAT(currentRoundingMode, 4294967281bv32), main_~#slope~0#1.base, ~bvadd32(4bv32, main_~#slope~0#1.offset), 4bv32);call write~init~intFLOATTYPE4(~convertINTToFLOAT(currentRoundingMode, 40bv32), main_~#slope~0#1.base, ~bvadd32(8bv32, main_~#slope~0#1.offset), 4bv32);call write~init~intFLOATTYPE4(~convertINTToFLOAT(currentRoundingMode, 4294967286bv32), main_~#slope~0#1.base, ~bvadd32(12bv32, main_~#slope~0#1.offset), 4bv32);call write~init~intFLOATTYPE4(~convertINTToFLOAT(currentRoundingMode, 0bv32), main_~#slope~0#1.base, ~bvadd32(16bv32, main_~#slope~0#1.offset), 4bv32);main_~t~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;call main_#t~mem5#1 := read~intFLOATTYPE4(main_~#min~0#1.base, main_~#min~0#1.offset, 4bv32);main_#t~short7#1 := ~fp.geq~FLOAT(main_~t~0#1, main_#t~mem5#1); {20#true} is VALID [2022-02-20 16:23:28,733 INFO L290 TraceCheckUtils]: 2: Hoare triple {20#true} assume main_#t~short7#1;call main_#t~mem6#1 := read~intFLOATTYPE4(main_~#max~0#1.base, ~bvadd32(16bv32, main_~#max~0#1.offset), 4bv32);main_#t~short7#1 := ~fp.leq~FLOAT(main_~t~0#1, main_#t~mem6#1); {20#true} is VALID [2022-02-20 16:23:28,734 INFO L290 TraceCheckUtils]: 3: Hoare triple {20#true} assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_#t~short7#1 then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {20#true} is VALID [2022-02-20 16:23:28,734 INFO L290 TraceCheckUtils]: 4: Hoare triple {20#true} assume 0bv32 == assume_abort_if_not_~cond#1;assume false; {21#false} is VALID [2022-02-20 16:23:28,734 INFO L290 TraceCheckUtils]: 5: Hoare triple {21#false} assume { :end_inline_assume_abort_if_not } true;havoc main_#t~mem5#1;havoc main_#t~mem6#1;havoc main_#t~short7#1;main_~i~0#1 := 0bv32; {21#false} is VALID [2022-02-20 16:23:28,735 INFO L290 TraceCheckUtils]: 6: Hoare triple {21#false} assume !true; {21#false} is VALID [2022-02-20 16:23:28,735 INFO L290 TraceCheckUtils]: 7: Hoare triple {21#false} call main_#t~mem14#1 := read~intFLOATTYPE4(main_~#org~0#1.base, ~bvadd32(main_~#org~0#1.offset, ~bvmul32(4bv32, main_~i~0#1)), 4bv32);call main_#t~mem11#1 := read~intFLOATTYPE4(main_~#slope~0#1.base, ~bvadd32(main_~#slope~0#1.offset, ~bvmul32(4bv32, main_~i~0#1)), 4bv32);call main_#t~mem10#1 := read~intFLOATTYPE4(main_~#min~0#1.base, ~bvadd32(main_~#min~0#1.offset, ~bvmul32(4bv32, main_~i~0#1)), 4bv32);call main_#t~mem12#1 := read~intFLOATTYPE4(main_~#max~0#1.base, ~bvadd32(main_~#max~0#1.offset, ~bvmul32(4bv32, main_~i~0#1)), 4bv32);call main_#t~mem13#1 := read~intFLOATTYPE4(main_~#min~0#1.base, ~bvadd32(main_~#min~0#1.offset, ~bvmul32(4bv32, main_~i~0#1)), 4bv32);main_~z~0#1 := ~fp.add~FLOAT(currentRoundingMode, main_#t~mem14#1, ~fp.div~FLOAT(currentRoundingMode, ~fp.mul~FLOAT(currentRoundingMode, main_#t~mem11#1, ~fp.sub~FLOAT(currentRoundingMode, main_~t~0#1, main_#t~mem10#1)), ~fp.sub~FLOAT(currentRoundingMode, main_#t~mem12#1, main_#t~mem13#1)));havoc main_#t~mem14#1;havoc main_#t~mem11#1;havoc main_#t~mem10#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if ~fp.geq~FLOAT(main_~z~0#1, ~fp.neg~FLOAT(~to_fp~FLOAT(currentRoundingMode, 10.0))) && ~fp.leq~FLOAT(main_~z~0#1, ~to_fp~FLOAT(currentRoundingMode, 30.0)) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {21#false} is VALID [2022-02-20 16:23:28,735 INFO L290 TraceCheckUtils]: 8: Hoare triple {21#false} assume 0bv32 == __VERIFIER_assert_~cond#1; {21#false} is VALID [2022-02-20 16:23:28,735 INFO L290 TraceCheckUtils]: 9: Hoare triple {21#false} assume !false; {21#false} is VALID [2022-02-20 16:23:28,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:23:28,736 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:23:28,737 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:23:28,737 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2060605959] [2022-02-20 16:23:28,737 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2060605959] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:23:28,737 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:23:28,738 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:23:28,739 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421799214] [2022-02-20 16:23:28,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:23:28,742 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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 10 [2022-02-20 16:23:28,743 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:23:28,745 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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) [2022-02-20 16:23:29,036 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:23:29,036 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:23:29,037 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:23:29,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:23:29,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:23:29,062 INFO L87 Difference]: Start difference. First operand has 17 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 16 states have internal predecessors, (22), 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 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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) [2022-02-20 16:23:31,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:23:31,262 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2022-02-20 16:23:31,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:23:31,262 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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 10 [2022-02-20 16:23:31,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:23:31,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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) [2022-02-20 16:23:31,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 37 transitions. [2022-02-20 16:23:31,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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) [2022-02-20 16:23:31,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 37 transitions. [2022-02-20 16:23:31,268 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 37 transitions. [2022-02-20 16:23:31,820 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:23:31,825 INFO L225 Difference]: With dead ends: 29 [2022-02-20 16:23:31,825 INFO L226 Difference]: Without dead ends: 13 [2022-02-20 16:23:31,827 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:23:31,833 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:23:31,834 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:23:31,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-02-20 16:23:31,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-02-20 16:23:31,866 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:23:31,867 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand has 13 states, 12 states have (on average 1.25) 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) [2022-02-20 16:23:31,868 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand has 13 states, 12 states have (on average 1.25) 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) [2022-02-20 16:23:31,869 INFO L87 Difference]: Start difference. First operand 13 states. Second operand has 13 states, 12 states have (on average 1.25) 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) [2022-02-20 16:23:31,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:23:31,875 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2022-02-20 16:23:31,875 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2022-02-20 16:23:31,875 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:23:31,875 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:23:31,876 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 12 states have (on average 1.25) 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) Second operand 13 states. [2022-02-20 16:23:31,876 INFO L87 Difference]: Start difference. First operand has 13 states, 12 states have (on average 1.25) 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) Second operand 13 states. [2022-02-20 16:23:31,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:23:31,883 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2022-02-20 16:23:31,884 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2022-02-20 16:23:31,884 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:23:31,885 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:23:31,885 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:23:31,885 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:23:31,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.25) 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) [2022-02-20 16:23:31,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2022-02-20 16:23:31,889 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 10 [2022-02-20 16:23:31,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:23:31,892 INFO L470 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2022-02-20 16:23:31,892 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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) [2022-02-20 16:23:31,893 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2022-02-20 16:23:31,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 16:23:31,894 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:23:31,894 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:23:31,909 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-02-20 16:23:32,108 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:23:32,108 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:23:32,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:23:32,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1178902664, now seen corresponding path program 1 times [2022-02-20 16:23:32,109 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:23:32,109 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [664405574] [2022-02-20 16:23:32,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:23:32,110 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:23:32,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:23:32,112 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:23:32,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-02-20 16:23:32,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:23:32,409 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-20 16:23:32,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:23:32,416 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:23:32,481 INFO L290 TraceCheckUtils]: 0: Hoare triple {126#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(17bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {126#true} is VALID [2022-02-20 16:23:32,481 INFO L290 TraceCheckUtils]: 1: Hoare triple {126#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~short7#1, main_#t~mem9#1, main_#t~post8#1, main_#t~mem14#1, main_#t~mem11#1, main_#t~mem10#1, main_#t~mem12#1, main_#t~mem13#1, main_~i~0#1, main_~z~0#1, main_~t~0#1, main_~#min~0#1.base, main_~#min~0#1.offset, main_~#max~0#1.base, main_~#max~0#1.offset, main_~#org~0#1.base, main_~#org~0#1.offset, main_~#slope~0#1.base, main_~#slope~0#1.offset;havoc main_~i~0#1;havoc main_~z~0#1;havoc main_~t~0#1;call main_~#min~0#1.base, main_~#min~0#1.offset := #Ultimate.allocOnStack(20bv32);call write~init~intFLOATTYPE4(~convertINTToFLOAT(currentRoundingMode, 5bv32), main_~#min~0#1.base, main_~#min~0#1.offset, 4bv32);call write~init~intFLOATTYPE4(~convertINTToFLOAT(currentRoundingMode, 10bv32), main_~#min~0#1.base, ~bvadd32(4bv32, main_~#min~0#1.offset), 4bv32);call write~init~intFLOATTYPE4(~convertINTToFLOAT(currentRoundingMode, 12bv32), main_~#min~0#1.base, ~bvadd32(8bv32, main_~#min~0#1.offset), 4bv32);call write~init~intFLOATTYPE4(~convertINTToFLOAT(currentRoundingMode, 30bv32), main_~#min~0#1.base, ~bvadd32(12bv32, main_~#min~0#1.offset), 4bv32);call write~init~intFLOATTYPE4(~convertINTToFLOAT(currentRoundingMode, 150bv32), main_~#min~0#1.base, ~bvadd32(16bv32, main_~#min~0#1.offset), 4bv32);call main_~#max~0#1.base, main_~#max~0#1.offset := #Ultimate.allocOnStack(20bv32);call write~init~intFLOATTYPE4(~convertINTToFLOAT(currentRoundingMode, 10bv32), main_~#max~0#1.base, main_~#max~0#1.offset, 4bv32);call write~init~intFLOATTYPE4(~convertINTToFLOAT(currentRoundingMode, 12bv32), main_~#max~0#1.base, ~bvadd32(4bv32, main_~#max~0#1.offset), 4bv32);call write~init~intFLOATTYPE4(~convertINTToFLOAT(currentRoundingMode, 30bv32), main_~#max~0#1.base, ~bvadd32(8bv32, main_~#max~0#1.offset), 4bv32);call write~init~intFLOATTYPE4(~convertINTToFLOAT(currentRoundingMode, 150bv32), main_~#max~0#1.base, ~bvadd32(12bv32, main_~#max~0#1.offset), 4bv32);call write~init~intFLOATTYPE4(~convertINTToFLOAT(currentRoundingMode, 300bv32), main_~#max~0#1.base, ~bvadd32(16bv32, main_~#max~0#1.offset), 4bv32);call main_~#org~0#1.base, main_~#org~0#1.offset := #Ultimate.allocOnStack(20bv32);call write~init~intFLOATTYPE4(~convertINTToFLOAT(currentRoundingMode, 1bv32), main_~#org~0#1.base, main_~#org~0#1.offset, 4bv32);call write~init~intFLOATTYPE4(~convertINTToFLOAT(currentRoundingMode, 5bv32), main_~#org~0#1.base, ~bvadd32(4bv32, main_~#org~0#1.offset), 4bv32);call write~init~intFLOATTYPE4(~convertINTToFLOAT(currentRoundingMode, 4294967286bv32), main_~#org~0#1.base, ~bvadd32(8bv32, main_~#org~0#1.offset), 4bv32);call write~init~intFLOATTYPE4(~convertINTToFLOAT(currentRoundingMode, 30bv32), main_~#org~0#1.base, ~bvadd32(12bv32, main_~#org~0#1.offset), 4bv32);call write~init~intFLOATTYPE4(~convertINTToFLOAT(currentRoundingMode, 20bv32), main_~#org~0#1.base, ~bvadd32(16bv32, main_~#org~0#1.offset), 4bv32);call main_~#slope~0#1.base, main_~#slope~0#1.offset := #Ultimate.allocOnStack(20bv32);call write~init~intFLOATTYPE4(~convertINTToFLOAT(currentRoundingMode, 4bv32), main_~#slope~0#1.base, main_~#slope~0#1.offset, 4bv32);call write~init~intFLOATTYPE4(~convertINTToFLOAT(currentRoundingMode, 4294967281bv32), main_~#slope~0#1.base, ~bvadd32(4bv32, main_~#slope~0#1.offset), 4bv32);call write~init~intFLOATTYPE4(~convertINTToFLOAT(currentRoundingMode, 40bv32), main_~#slope~0#1.base, ~bvadd32(8bv32, main_~#slope~0#1.offset), 4bv32);call write~init~intFLOATTYPE4(~convertINTToFLOAT(currentRoundingMode, 4294967286bv32), main_~#slope~0#1.base, ~bvadd32(12bv32, main_~#slope~0#1.offset), 4bv32);call write~init~intFLOATTYPE4(~convertINTToFLOAT(currentRoundingMode, 0bv32), main_~#slope~0#1.base, ~bvadd32(16bv32, main_~#slope~0#1.offset), 4bv32);main_~t~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;call main_#t~mem5#1 := read~intFLOATTYPE4(main_~#min~0#1.base, main_~#min~0#1.offset, 4bv32);main_#t~short7#1 := ~fp.geq~FLOAT(main_~t~0#1, main_#t~mem5#1); {126#true} is VALID [2022-02-20 16:23:32,482 INFO L290 TraceCheckUtils]: 2: Hoare triple {126#true} assume main_#t~short7#1;call main_#t~mem6#1 := read~intFLOATTYPE4(main_~#max~0#1.base, ~bvadd32(16bv32, main_~#max~0#1.offset), 4bv32);main_#t~short7#1 := ~fp.leq~FLOAT(main_~t~0#1, main_#t~mem6#1); {126#true} is VALID [2022-02-20 16:23:32,482 INFO L290 TraceCheckUtils]: 3: Hoare triple {126#true} assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_#t~short7#1 then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {126#true} is VALID [2022-02-20 16:23:32,482 INFO L290 TraceCheckUtils]: 4: Hoare triple {126#true} assume !(0bv32 == assume_abort_if_not_~cond#1); {126#true} is VALID [2022-02-20 16:23:32,483 INFO L290 TraceCheckUtils]: 5: Hoare triple {126#true} assume { :end_inline_assume_abort_if_not } true;havoc main_#t~mem5#1;havoc main_#t~mem6#1;havoc main_#t~short7#1;main_~i~0#1 := 0bv32; {146#(= |ULTIMATE.start_main_~i~0#1| (_ bv0 32))} is VALID [2022-02-20 16:23:32,483 INFO L290 TraceCheckUtils]: 6: Hoare triple {146#(= |ULTIMATE.start_main_~i~0#1| (_ bv0 32))} assume !~bvult32(main_~i~0#1, 5bv32); {127#false} is VALID [2022-02-20 16:23:32,483 INFO L290 TraceCheckUtils]: 7: Hoare triple {127#false} call main_#t~mem14#1 := read~intFLOATTYPE4(main_~#org~0#1.base, ~bvadd32(main_~#org~0#1.offset, ~bvmul32(4bv32, main_~i~0#1)), 4bv32);call main_#t~mem11#1 := read~intFLOATTYPE4(main_~#slope~0#1.base, ~bvadd32(main_~#slope~0#1.offset, ~bvmul32(4bv32, main_~i~0#1)), 4bv32);call main_#t~mem10#1 := read~intFLOATTYPE4(main_~#min~0#1.base, ~bvadd32(main_~#min~0#1.offset, ~bvmul32(4bv32, main_~i~0#1)), 4bv32);call main_#t~mem12#1 := read~intFLOATTYPE4(main_~#max~0#1.base, ~bvadd32(main_~#max~0#1.offset, ~bvmul32(4bv32, main_~i~0#1)), 4bv32);call main_#t~mem13#1 := read~intFLOATTYPE4(main_~#min~0#1.base, ~bvadd32(main_~#min~0#1.offset, ~bvmul32(4bv32, main_~i~0#1)), 4bv32);main_~z~0#1 := ~fp.add~FLOAT(currentRoundingMode, main_#t~mem14#1, ~fp.div~FLOAT(currentRoundingMode, ~fp.mul~FLOAT(currentRoundingMode, main_#t~mem11#1, ~fp.sub~FLOAT(currentRoundingMode, main_~t~0#1, main_#t~mem10#1)), ~fp.sub~FLOAT(currentRoundingMode, main_#t~mem12#1, main_#t~mem13#1)));havoc main_#t~mem14#1;havoc main_#t~mem11#1;havoc main_#t~mem10#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if ~fp.geq~FLOAT(main_~z~0#1, ~fp.neg~FLOAT(~to_fp~FLOAT(currentRoundingMode, 10.0))) && ~fp.leq~FLOAT(main_~z~0#1, ~to_fp~FLOAT(currentRoundingMode, 30.0)) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {127#false} is VALID [2022-02-20 16:23:32,483 INFO L290 TraceCheckUtils]: 8: Hoare triple {127#false} assume 0bv32 == __VERIFIER_assert_~cond#1; {127#false} is VALID [2022-02-20 16:23:32,484 INFO L290 TraceCheckUtils]: 9: Hoare triple {127#false} assume !false; {127#false} is VALID [2022-02-20 16:23:32,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:23:32,484 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:23:32,484 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:23:32,484 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [664405574] [2022-02-20 16:23:32,485 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [664405574] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:23:32,485 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:23:32,485 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 16:23:32,485 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88955501] [2022-02-20 16:23:32,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:23:32,486 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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 10 [2022-02-20 16:23:32,486 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:23:32,486 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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) [2022-02-20 16:23:32,757 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:23:32,757 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 16:23:32,757 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:23:32,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 16:23:32,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:23:32,758 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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) [2022-02-20 16:23:35,060 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-20 16:23:35,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:23:35,207 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2022-02-20 16:23:35,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 16:23:35,208 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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 10 [2022-02-20 16:23:35,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:23:35,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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) [2022-02-20 16:23:35,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 24 transitions. [2022-02-20 16:23:35,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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) [2022-02-20 16:23:35,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 24 transitions. [2022-02-20 16:23:35,218 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 24 transitions. [2022-02-20 16:23:36,030 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:23:36,031 INFO L225 Difference]: With dead ends: 21 [2022-02-20 16:23:36,031 INFO L226 Difference]: Without dead ends: 17 [2022-02-20 16:23:36,031 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:23:36,032 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 3 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-02-20 16:23:36,033 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 21 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-02-20 16:23:36,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-02-20 16:23:36,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 14. [2022-02-20 16:23:36,034 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:23:36,034 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 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) [2022-02-20 16:23:36,035 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 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) [2022-02-20 16:23:36,035 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 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) [2022-02-20 16:23:36,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:23:36,035 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2022-02-20 16:23:36,035 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2022-02-20 16:23:36,036 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:23:36,036 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:23:36,036 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 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 17 states. [2022-02-20 16:23:36,036 INFO L87 Difference]: Start difference. First operand has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 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 17 states. [2022-02-20 16:23:36,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:23:36,037 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2022-02-20 16:23:36,037 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2022-02-20 16:23:36,037 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:23:36,037 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:23:36,037 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:23:36,037 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:23:36,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 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) [2022-02-20 16:23:36,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2022-02-20 16:23:36,038 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 10 [2022-02-20 16:23:36,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:23:36,038 INFO L470 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2022-02-20 16:23:36,038 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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) [2022-02-20 16:23:36,038 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2022-02-20 16:23:36,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 16:23:36,039 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:23:36,039 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:23:36,063 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-02-20 16:23:36,239 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:23:36,240 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:23:36,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:23:36,240 INFO L85 PathProgramCache]: Analyzing trace with hash 2110328889, now seen corresponding path program 1 times [2022-02-20 16:23:36,241 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:23:36,241 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1843516578] [2022-02-20 16:23:36,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:23:36,241 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:23:36,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:23:36,244 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:23:36,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-02-20 16:23:36,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:23:36,873 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 30 conjunts are in the unsatisfiable core [2022-02-20 16:23:38,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-02-20 16:23:38,923 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:23:47,971 WARN L228 SmtUtils]: Spent 5.96s on a formula simplification. DAG size of input: 33 DAG size of output: 17 (called from [L 353] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-02-20 16:23:47,976 INFO L356 Elim1Store]: treesize reduction 24, result has 51.0 percent of original size [2022-02-20 16:23:47,978 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 612 treesize of output 312