./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-benchs/interpolation.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-benchs/interpolation.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 30f6a485d859f7eee00a1696279d966456b3a38851c6233a0367f621da73d6bd --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 02:28:56,218 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 02:28:56,219 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 02:28:56,242 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 02:28:56,242 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 02:28:56,243 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 02:28:56,245 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 02:28:56,249 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 02:28:56,250 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 02:28:56,251 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 02:28:56,251 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 02:28:56,252 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 02:28:56,252 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 02:28:56,253 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 02:28:56,253 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 02:28:56,254 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 02:28:56,254 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 02:28:56,255 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 02:28:56,257 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 02:28:56,264 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 02:28:56,267 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 02:28:56,268 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 02:28:56,269 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 02:28:56,270 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 02:28:56,270 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 02:28:56,273 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 02:28:56,273 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 02:28:56,274 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 02:28:56,274 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 02:28:56,274 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 02:28:56,275 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 02:28:56,276 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 02:28:56,276 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 02:28:56,277 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 02:28:56,278 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 02:28:56,278 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 02:28:56,278 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 02:28:56,279 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 02:28:56,279 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 02:28:56,279 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 02:28:56,279 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 02:28:56,280 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 02:28:56,281 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-12 02:28:56,298 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 02:28:56,302 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 02:28:56,302 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 02:28:56,302 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 02:28:56,303 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 02:28:56,303 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 02:28:56,303 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 02:28:56,303 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 02:28:56,303 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 02:28:56,304 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 02:28:56,304 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 02:28:56,305 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 02:28:56,305 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 02:28:56,305 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 02:28:56,305 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 02:28:56,305 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 02:28:56,305 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 02:28:56,305 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 02:28:56,305 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 02:28:56,306 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 02:28:56,306 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 02:28:56,306 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 02:28:56,306 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 02:28:56,306 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 02:28:56,306 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 02:28:56,307 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 02:28:56,307 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 02:28:56,307 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 02:28:56,307 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 02:28:56,307 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 02:28:56,307 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 02:28:56,308 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 02:28:56,308 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 02:28:56,308 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 -> 30f6a485d859f7eee00a1696279d966456b3a38851c6233a0367f621da73d6bd [2022-07-12 02:28:56,482 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 02:28:56,501 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 02:28:56,503 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 02:28:56,504 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 02:28:56,504 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 02:28:56,505 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/interpolation.c [2022-07-12 02:28:56,557 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de2363817/eb9959f03c3c4c62ab0b202b5440ae53/FLAGe81fcd7b4 [2022-07-12 02:28:56,895 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 02:28:56,896 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/interpolation.c [2022-07-12 02:28:56,899 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de2363817/eb9959f03c3c4c62ab0b202b5440ae53/FLAGe81fcd7b4 [2022-07-12 02:28:56,907 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de2363817/eb9959f03c3c4c62ab0b202b5440ae53 [2022-07-12 02:28:56,909 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 02:28:56,910 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 02:28:56,911 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 02:28:56,912 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 02:28:56,921 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 02:28:56,921 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 02:28:56" (1/1) ... [2022-07-12 02:28:56,922 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@de74211 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:28:56, skipping insertion in model container [2022-07-12 02:28:56,922 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 02:28:56" (1/1) ... [2022-07-12 02:28:56,926 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 02:28:56,940 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 02:28:57,039 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/interpolation.c[449,462] [2022-07-12 02:28:57,051 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 02:28:57,055 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 02:28:57,062 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/interpolation.c[449,462] [2022-07-12 02:28:57,067 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 02:28:57,077 INFO L208 MainTranslator]: Completed translation [2022-07-12 02:28:57,078 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:28:57 WrapperNode [2022-07-12 02:28:57,078 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 02:28:57,079 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 02:28:57,079 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 02:28:57,079 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 02:28:57,084 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:28:57" (1/1) ... [2022-07-12 02:28:57,090 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:28:57" (1/1) ... [2022-07-12 02:28:57,102 INFO L137 Inliner]: procedures = 18, calls = 31, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 76 [2022-07-12 02:28:57,102 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 02:28:57,103 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 02:28:57,103 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 02:28:57,103 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 02:28:57,108 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:28:57" (1/1) ... [2022-07-12 02:28:57,108 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:28:57" (1/1) ... [2022-07-12 02:28:57,110 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:28:57" (1/1) ... [2022-07-12 02:28:57,110 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:28:57" (1/1) ... [2022-07-12 02:28:57,113 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:28:57" (1/1) ... [2022-07-12 02:28:57,117 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:28:57" (1/1) ... [2022-07-12 02:28:57,118 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:28:57" (1/1) ... [2022-07-12 02:28:57,122 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 02:28:57,122 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 02:28:57,122 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 02:28:57,122 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 02:28:57,128 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:28:57" (1/1) ... [2022-07-12 02:28:57,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 02:28:57,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 02:28:57,164 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-12 02:28:57,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-12 02:28:57,192 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 02:28:57,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 02:28:57,193 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 02:28:57,193 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-07-12 02:28:57,193 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 02:28:57,193 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 02:28:57,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2022-07-12 02:28:57,193 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 02:28:57,242 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 02:28:57,243 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 02:28:57,329 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 02:28:57,333 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 02:28:57,333 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-12 02:28:57,334 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 02:28:57 BoogieIcfgContainer [2022-07-12 02:28:57,334 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 02:28:57,335 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 02:28:57,335 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 02:28:57,338 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 02:28:57,339 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 02:28:56" (1/3) ... [2022-07-12 02:28:57,339 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a4f6caa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 02:28:57, skipping insertion in model container [2022-07-12 02:28:57,339 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:28:57" (2/3) ... [2022-07-12 02:28:57,339 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a4f6caa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 02:28:57, skipping insertion in model container [2022-07-12 02:28:57,340 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 02:28:57" (3/3) ... [2022-07-12 02:28:57,340 INFO L111 eAbstractionObserver]: Analyzing ICFG interpolation.c [2022-07-12 02:28:57,349 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 02:28:57,349 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 02:28:57,377 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 02:28:57,385 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6b8b1d5f, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1cc378e2 [2022-07-12 02:28:57,389 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 02:28:57,392 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-07-12 02:28:57,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-12 02:28:57,396 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 02:28:57,396 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 02:28:57,397 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 02:28:57,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 02:28:57,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1235833265, now seen corresponding path program 1 times [2022-07-12 02:28:57,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 02:28:57,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967519540] [2022-07-12 02:28:57,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 02:28:57,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 02:28:57,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 02:28:57,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 02:28:57,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 02:28:57,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967519540] [2022-07-12 02:28:57,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967519540] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 02:28:57,488 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 02:28:57,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 02:28:57,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453936822] [2022-07-12 02:28:57,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 02:28:57,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-12 02:28:57,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 02:28:57,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-12 02:28:57,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 02:28:57,516 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-07-12 02:28:57,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 02:28:57,526 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2022-07-12 02:28:57,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-12 02:28:57,528 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-07-12 02:28:57,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 02:28:57,534 INFO L225 Difference]: With dead ends: 29 [2022-07-12 02:28:57,534 INFO L226 Difference]: Without dead ends: 13 [2022-07-12 02:28:57,537 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 02:28:57,541 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 02:28:57,542 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 02:28:57,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-07-12 02:28:57,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-07-12 02:28:57,560 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-07-12 02:28:57,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2022-07-12 02:28:57,561 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 10 [2022-07-12 02:28:57,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 02:28:57,561 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2022-07-12 02:28:57,562 INFO L496 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-07-12 02:28:57,562 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2022-07-12 02:28:57,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-12 02:28:57,562 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 02:28:57,563 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 02:28:57,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 02:28:57,563 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 02:28:57,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 02:28:57,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1178902664, now seen corresponding path program 1 times [2022-07-12 02:28:57,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 02:28:57,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35442962] [2022-07-12 02:28:57,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 02:28:57,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 02:28:57,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 02:28:57,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 02:28:57,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 02:28:57,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35442962] [2022-07-12 02:28:57,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35442962] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 02:28:57,642 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 02:28:57,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 02:28:57,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214121746] [2022-07-12 02:28:57,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 02:28:57,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 02:28:57,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 02:28:57,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 02:28:57,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 02:28:57,645 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-07-12 02:28:57,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 02:28:57,682 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-07-12 02:28:57,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 02:28:57,683 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-07-12 02:28:57,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 02:28:57,683 INFO L225 Difference]: With dead ends: 24 [2022-07-12 02:28:57,683 INFO L226 Difference]: Without dead ends: 20 [2022-07-12 02:28:57,684 INFO L412 NwaCegarLoop]: 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-07-12 02:28:57,685 INFO L413 NwaCegarLoop]: 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-07-12 02:28:57,685 INFO L414 NwaCegarLoop]: 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-07-12 02:28:57,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-07-12 02:28:57,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 14. [2022-07-12 02:28:57,687 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-07-12 02:28:57,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2022-07-12 02:28:57,688 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 10 [2022-07-12 02:28:57,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 02:28:57,688 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2022-07-12 02:28:57,689 INFO L496 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-07-12 02:28:57,689 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2022-07-12 02:28:57,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-12 02:28:57,694 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 02:28:57,694 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 02:28:57,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 02:28:57,694 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 02:28:57,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 02:28:57,695 INFO L85 PathProgramCache]: Analyzing trace with hash 2110328889, now seen corresponding path program 1 times [2022-07-12 02:28:57,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 02:28:57,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797843509] [2022-07-12 02:28:57,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 02:28:57,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 02:28:57,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 02:28:57,717 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-12 02:28:57,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 02:28:57,740 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-12 02:28:57,741 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-12 02:28:57,742 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-12 02:28:57,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 02:28:57,745 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-07-12 02:28:57,747 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-12 02:28:57,763 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.07 02:28:57 BoogieIcfgContainer [2022-07-12 02:28:57,764 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-12 02:28:57,764 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-12 02:28:57,764 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-12 02:28:57,764 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-12 02:28:57,765 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 02:28:57" (3/4) ... [2022-07-12 02:28:57,766 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-12 02:28:57,767 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-12 02:28:57,767 INFO L158 Benchmark]: Toolchain (without parser) took 857.17ms. Allocated memory was 100.7MB in the beginning and 121.6MB in the end (delta: 21.0MB). Free memory was 63.2MB in the beginning and 93.6MB in the end (delta: -30.4MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 02:28:57,768 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 100.7MB. Free memory was 79.6MB in the beginning and 79.6MB in the end (delta: 90.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 02:28:57,768 INFO L158 Benchmark]: CACSL2BoogieTranslator took 166.54ms. Allocated memory is still 100.7MB. Free memory was 62.9MB in the beginning and 75.3MB in the end (delta: -12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-12 02:28:57,768 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.78ms. Allocated memory is still 100.7MB. Free memory was 75.3MB in the beginning and 73.7MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 02:28:57,769 INFO L158 Benchmark]: Boogie Preprocessor took 18.83ms. Allocated memory is still 100.7MB. Free memory was 73.7MB in the beginning and 72.4MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 02:28:57,769 INFO L158 Benchmark]: RCFGBuilder took 212.00ms. Allocated memory is still 100.7MB. Free memory was 72.4MB in the beginning and 62.0MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-12 02:28:57,770 INFO L158 Benchmark]: TraceAbstraction took 428.40ms. Allocated memory was 100.7MB in the beginning and 121.6MB in the end (delta: 21.0MB). Free memory was 61.6MB in the beginning and 94.2MB in the end (delta: -32.7MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 02:28:57,770 INFO L158 Benchmark]: Witness Printer took 2.63ms. Allocated memory is still 121.6MB. Free memory was 94.2MB in the beginning and 93.6MB in the end (delta: 618.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 02:28:57,772 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 100.7MB. Free memory was 79.6MB in the beginning and 79.6MB in the end (delta: 90.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 166.54ms. Allocated memory is still 100.7MB. Free memory was 62.9MB in the beginning and 75.3MB in the end (delta: -12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.78ms. Allocated memory is still 100.7MB. Free memory was 75.3MB in the beginning and 73.7MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 18.83ms. Allocated memory is still 100.7MB. Free memory was 73.7MB in the beginning and 72.4MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 212.00ms. Allocated memory is still 100.7MB. Free memory was 72.4MB in the beginning and 62.0MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 428.40ms. Allocated memory was 100.7MB in the beginning and 121.6MB in the end (delta: 21.0MB). Free memory was 61.6MB in the beginning and 94.2MB in the end (delta: -32.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.63ms. Allocated memory is still 121.6MB. Free memory was 94.2MB in the beginning and 93.6MB in the end (delta: 618.8kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 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 26, overapproximation of to_real at line 15, overapproximation of someBinaryArithmeticFLOAToperation at line 24. 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 }; [L18] t = __VERIFIER_nondet_float() [L19] EXPR min[0] [L19] EXPR t >= min[0] && t <= max[sizeof(max) / sizeof(max[0]) - 1] [L19] EXPR max[sizeof(max) / sizeof(max[0]) - 1] [L19] EXPR t >= min[0] && t <= max[sizeof(max) / sizeof(max[0]) - 1] VAL [max={4:0}, max[sizeof(max) / sizeof(max[0]) - 1]=51, min={5:0}, min[0]=50] [L19] 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] [L19] RET assume_abort_if_not(t >= min[0] && t <= max[sizeof(max) / sizeof(max[0]) - 1]) [L21] i = 0 VAL [i=0, max={4:0}, min={5:0}] [L21] COND TRUE i < sizeof(min) / sizeof(min[0]) [L22] EXPR max[i] VAL [i=0, max={4:0}, max[i]=49, min={5:0}] [L22] COND TRUE t <= max[i] [L24] EXPR min[i] [L24] EXPR max[i] [L24] EXPR min[i] [L24] z = (t - min[i]) / (max[i] - min[i]) [L26] CALL __VERIFIER_assert(z >= 0.f && z <= 1.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.4s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 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.0s 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-07-12 02:28:57,811 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-benchs/interpolation.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 30f6a485d859f7eee00a1696279d966456b3a38851c6233a0367f621da73d6bd --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 02:28:59,398 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 02:28:59,400 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 02:28:59,431 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 02:28:59,432 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 02:28:59,433 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 02:28:59,435 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 02:28:59,438 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 02:28:59,441 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 02:28:59,444 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 02:28:59,445 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 02:28:59,446 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 02:28:59,446 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 02:28:59,448 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 02:28:59,448 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 02:28:59,451 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 02:28:59,451 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 02:28:59,452 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 02:28:59,453 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 02:28:59,457 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 02:28:59,458 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 02:28:59,459 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 02:28:59,460 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 02:28:59,461 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 02:28:59,462 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 02:28:59,467 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 02:28:59,467 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 02:28:59,467 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 02:28:59,468 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 02:28:59,468 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 02:28:59,469 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 02:28:59,469 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 02:28:59,470 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 02:28:59,470 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 02:28:59,471 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 02:28:59,472 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 02:28:59,472 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 02:28:59,472 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 02:28:59,473 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 02:28:59,473 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 02:28:59,473 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 02:28:59,474 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 02:28:59,478 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-12 02:28:59,501 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 02:28:59,502 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 02:28:59,502 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 02:28:59,502 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 02:28:59,502 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 02:28:59,503 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 02:28:59,503 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 02:28:59,503 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 02:28:59,503 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 02:28:59,504 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 02:28:59,504 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 02:28:59,504 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 02:28:59,504 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 02:28:59,505 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 02:28:59,511 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 02:28:59,512 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 02:28:59,512 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-12 02:28:59,512 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-12 02:28:59,512 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-12 02:28:59,512 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 02:28:59,513 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 02:28:59,513 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 02:28:59,513 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 02:28:59,513 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 02:28:59,513 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 02:28:59,513 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 02:28:59,513 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 02:28:59,514 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 02:28:59,514 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 02:28:59,514 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 02:28:59,514 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-12 02:28:59,514 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-12 02:28:59,515 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 02:28:59,515 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 02:28:59,515 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 02:28:59,515 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-12 02:28:59,515 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 -> 30f6a485d859f7eee00a1696279d966456b3a38851c6233a0367f621da73d6bd [2022-07-12 02:28:59,776 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 02:28:59,792 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 02:28:59,794 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 02:28:59,794 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 02:28:59,795 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 02:28:59,796 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/interpolation.c [2022-07-12 02:28:59,837 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df9857780/1a4368ead72f445c8e296af2feac77e1/FLAG02077db29 [2022-07-12 02:29:00,236 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 02:29:00,237 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/interpolation.c [2022-07-12 02:29:00,241 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df9857780/1a4368ead72f445c8e296af2feac77e1/FLAG02077db29 [2022-07-12 02:29:00,252 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df9857780/1a4368ead72f445c8e296af2feac77e1 [2022-07-12 02:29:00,254 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 02:29:00,255 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 02:29:00,257 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 02:29:00,257 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 02:29:00,259 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 02:29:00,260 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 02:29:00" (1/1) ... [2022-07-12 02:29:00,261 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@513cb219 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:29:00, skipping insertion in model container [2022-07-12 02:29:00,261 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 02:29:00" (1/1) ... [2022-07-12 02:29:00,265 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 02:29:00,274 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 02:29:00,387 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/interpolation.c[449,462] [2022-07-12 02:29:00,412 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 02:29:00,421 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 02:29:00,436 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/interpolation.c[449,462] [2022-07-12 02:29:00,460 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 02:29:00,471 INFO L208 MainTranslator]: Completed translation [2022-07-12 02:29:00,472 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:29:00 WrapperNode [2022-07-12 02:29:00,472 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 02:29:00,473 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 02:29:00,473 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 02:29:00,473 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 02:29:00,477 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:29:00" (1/1) ... [2022-07-12 02:29:00,492 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:29:00" (1/1) ... [2022-07-12 02:29:00,512 INFO L137 Inliner]: procedures = 19, calls = 31, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 77 [2022-07-12 02:29:00,513 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 02:29:00,514 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 02:29:00,514 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 02:29:00,514 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 02:29:00,520 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:29:00" (1/1) ... [2022-07-12 02:29:00,520 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:29:00" (1/1) ... [2022-07-12 02:29:00,527 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:29:00" (1/1) ... [2022-07-12 02:29:00,527 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:29:00" (1/1) ... [2022-07-12 02:29:00,542 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:29:00" (1/1) ... [2022-07-12 02:29:00,544 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:29:00" (1/1) ... [2022-07-12 02:29:00,545 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:29:00" (1/1) ... [2022-07-12 02:29:00,547 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 02:29:00,550 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 02:29:00,551 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 02:29:00,551 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 02:29:00,552 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:29:00" (1/1) ... [2022-07-12 02:29:00,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 02:29:00,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 02:29:00,571 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-12 02:29:00,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-12 02:29:00,601 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 02:29:00,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4 [2022-07-12 02:29:00,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-12 02:29:00,604 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 02:29:00,605 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2022-07-12 02:29:00,605 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 02:29:00,605 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 02:29:00,605 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 02:29:00,647 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 02:29:00,648 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 02:29:02,882 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 02:29:02,885 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 02:29:02,895 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-12 02:29:02,897 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 02:29:02 BoogieIcfgContainer [2022-07-12 02:29:02,897 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 02:29:02,901 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 02:29:02,901 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 02:29:02,903 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 02:29:02,903 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 02:29:00" (1/3) ... [2022-07-12 02:29:02,903 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35f7ee0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 02:29:02, skipping insertion in model container [2022-07-12 02:29:02,904 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:29:00" (2/3) ... [2022-07-12 02:29:02,904 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35f7ee0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 02:29:02, skipping insertion in model container [2022-07-12 02:29:02,904 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 02:29:02" (3/3) ... [2022-07-12 02:29:02,905 INFO L111 eAbstractionObserver]: Analyzing ICFG interpolation.c [2022-07-12 02:29:02,913 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 02:29:02,914 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 02:29:02,948 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 02:29:02,955 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5df9d122, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1119cfa2 [2022-07-12 02:29:02,955 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 02:29:02,958 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-07-12 02:29:02,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-12 02:29:02,962 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 02:29:02,963 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 02:29:02,964 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 02:29:02,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 02:29:02,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1235833265, now seen corresponding path program 1 times [2022-07-12 02:29:02,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 02:29:02,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1087102770] [2022-07-12 02:29:02,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 02:29:02,980 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 02:29:02,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 02:29:02,983 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 02:29:02,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-12 02:29:03,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 02:29:03,231 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-12 02:29:03,234 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 02:29:03,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 02:29:03,248 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 02:29:03,248 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 02:29:03,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1087102770] [2022-07-12 02:29:03,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1087102770] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 02:29:03,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 02:29:03,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 02:29:03,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514771854] [2022-07-12 02:29:03,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 02:29:03,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-12 02:29:03,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 02:29:03,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-12 02:29:03,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 02:29:03,270 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-07-12 02:29:03,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 02:29:03,278 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2022-07-12 02:29:03,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-12 02:29:03,280 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-07-12 02:29:03,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 02:29:03,284 INFO L225 Difference]: With dead ends: 29 [2022-07-12 02:29:03,285 INFO L226 Difference]: Without dead ends: 13 [2022-07-12 02:29:03,286 INFO L412 NwaCegarLoop]: 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-07-12 02:29:03,291 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 02:29:03,292 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 02:29:03,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-07-12 02:29:03,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-07-12 02:29:03,308 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-07-12 02:29:03,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2022-07-12 02:29:03,308 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 10 [2022-07-12 02:29:03,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 02:29:03,309 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2022-07-12 02:29:03,309 INFO L496 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-07-12 02:29:03,311 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2022-07-12 02:29:03,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-12 02:29:03,311 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 02:29:03,311 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 02:29:03,329 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-12 02:29:03,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 02:29:03,526 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 02:29:03,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 02:29:03,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1178902664, now seen corresponding path program 1 times [2022-07-12 02:29:03,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 02:29:03,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1802593840] [2022-07-12 02:29:03,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 02:29:03,527 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 02:29:03,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 02:29:03,528 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 02:29:03,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-12 02:29:03,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 02:29:03,739 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-12 02:29:03,741 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 02:29:03,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 02:29:03,768 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 02:29:03,769 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 02:29:03,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1802593840] [2022-07-12 02:29:03,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1802593840] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 02:29:03,769 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 02:29:03,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 02:29:03,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74892159] [2022-07-12 02:29:03,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 02:29:03,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 02:29:03,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 02:29:03,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 02:29:03,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 02:29:03,774 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-07-12 02:29:05,883 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 02:29:05,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 02:29:05,934 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2022-07-12 02:29:05,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 02:29:05,935 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-07-12 02:29:05,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 02:29:05,936 INFO L225 Difference]: With dead ends: 21 [2022-07-12 02:29:05,936 INFO L226 Difference]: Without dead ends: 17 [2022-07-12 02:29:05,936 INFO L412 NwaCegarLoop]: 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-07-12 02:29:05,937 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 3 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s 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.2s IncrementalHoareTripleChecker+Time [2022-07-12 02:29:05,937 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 21 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-12 02:29:05,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-07-12 02:29:05,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 14. [2022-07-12 02:29:05,939 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-07-12 02:29:05,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2022-07-12 02:29:05,940 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 10 [2022-07-12 02:29:05,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 02:29:05,940 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2022-07-12 02:29:05,940 INFO L496 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-07-12 02:29:05,940 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2022-07-12 02:29:05,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-12 02:29:05,940 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 02:29:05,940 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 02:29:05,956 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-12 02:29:06,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 02:29:06,149 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 02:29:06,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 02:29:06,150 INFO L85 PathProgramCache]: Analyzing trace with hash 2110328889, now seen corresponding path program 1 times [2022-07-12 02:29:06,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 02:29:06,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [615344448] [2022-07-12 02:29:06,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 02:29:06,150 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 02:29:06,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 02:29:06,151 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 02:29:06,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-12 02:29:06,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 02:29:06,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-12 02:29:06,610 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 02:29:08,408 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 02:29:08,409 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 392 treesize of output 192 [2022-07-12 02:29:18,376 WARN L233 SmtUtils]: Spent 5.20s on a formula simplification. DAG size of input: 9 DAG size of output: 1 (called from [L 813] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-12 02:30:06,274 WARN L833 $PredicateComparison]: unable to prove that (or (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32)) (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)) (exists ((v_arrayElimCell_1 (_ BitVec 32)) (v_arrayElimCell_3 (_ BitVec 32)) (|ULTIMATE.start_main_~t~0#1| (_ FloatingPoint 8 24))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3)))) (and (fp.leq |ULTIMATE.start_main_~t~0#1| .cse0) (= .cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32))) (not (fp.leq (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~t~0#1| .cse1) (fp.sub roundNearestTiesToEven .cse0 .cse1)) ((_ to_fp 8 24) roundNearestTiesToEven 1.0))) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32)) .cse0)))))) is different from false [2022-07-12 02:30:23,600 WARN L833 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1 (_ BitVec 32)) (v_arrayElimCell_3 (_ BitVec 32)) (|ULTIMATE.start_main_~t~0#1| (_ FloatingPoint 8 24))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3)))) (and (fp.leq |ULTIMATE.start_main_~t~0#1| .cse0) (= .cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32))) (not (fp.leq (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~t~0#1| .cse1) (fp.sub roundNearestTiesToEven .cse0 .cse1)) ((_ to_fp 8 24) roundNearestTiesToEven 1.0))) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32)) .cse0)))) is different from false [2022-07-12 02:30:25,619 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1 (_ BitVec 32)) (v_arrayElimCell_3 (_ BitVec 32)) (|ULTIMATE.start_main_~t~0#1| (_ FloatingPoint 8 24))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3)))) (and (fp.leq |ULTIMATE.start_main_~t~0#1| .cse0) (= .cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32))) (not (fp.leq (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~t~0#1| .cse1) (fp.sub roundNearestTiesToEven .cse0 .cse1)) ((_ to_fp 8 24) roundNearestTiesToEven 1.0))) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32)) .cse0)))) is different from true [2022-07-12 02:30:25,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 02:30:25,620 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 02:30:25,620 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 02:30:25,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [615344448] [2022-07-12 02:30:25,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [615344448] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 02:30:25,621 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 02:30:25,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 02:30:25,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982529782] [2022-07-12 02:30:25,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 02:30:25,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-12 02:30:25,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 02:30:25,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-12 02:30:25,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=62, Unknown=3, NotChecked=34, Total=132 [2022-07-12 02:30:25,622 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand has 12 states, 11 states have (on average 1.0) internal successors, (11), 11 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:30:28,547 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 02:32:00,319 WARN L233 SmtUtils]: Spent 1.42m on a formula simplification. DAG size of input: 91 DAG size of output: 85 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 02:32:02,602 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 02:32:04,084 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 02:32:06,336 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 02:32:06,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 02:32:06,723 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2022-07-12 02:32:06,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 02:32:06,724 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.0) internal successors, (11), 11 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-12 02:32:06,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 02:32:06,724 INFO L225 Difference]: With dead ends: 29 [2022-07-12 02:32:06,724 INFO L226 Difference]: Without dead ends: 25 [2022-07-12 02:32:06,725 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 99.5s TimeCoverageRelationStatistics Valid=87, Invalid=188, Unknown=5, NotChecked=62, Total=342 [2022-07-12 02:32:06,726 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 41 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 11 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 37 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2022-07-12 02:32:06,726 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 20 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 86 Invalid, 2 Unknown, 37 Unchecked, 8.5s Time] [2022-07-12 02:32:06,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-07-12 02:32:06,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 19. [2022-07-12 02:32:06,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 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-07-12 02:32:06,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2022-07-12 02:32:06,729 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 11 [2022-07-12 02:32:06,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 02:32:06,730 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-07-12 02:32:06,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.0) internal successors, (11), 11 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:32:06,730 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-07-12 02:32:06,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-12 02:32:06,731 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 02:32:06,731 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 02:32:06,747 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-12 02:32:06,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 02:32:06,937 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 02:32:06,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 02:32:06,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1504580037, now seen corresponding path program 1 times [2022-07-12 02:32:06,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 02:32:06,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [458593647] [2022-07-12 02:32:06,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 02:32:06,939 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 02:32:06,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 02:32:06,940 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 02:32:06,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-12 02:32:07,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 02:32:07,131 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 02:32:07,132 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 02:32:07,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 02:32:07,159 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 02:32:07,159 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 02:32:07,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [458593647] [2022-07-12 02:32:07,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [458593647] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 02:32:07,160 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 02:32:07,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 02:32:07,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735586804] [2022-07-12 02:32:07,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 02:32:07,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 02:32:07,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 02:32:07,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 02:32:07,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 02:32:07,161 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:32:07,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 02:32:07,200 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-07-12 02:32:07,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 02:32:07,201 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-12 02:32:07,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 02:32:07,202 INFO L225 Difference]: With dead ends: 26 [2022-07-12 02:32:07,202 INFO L226 Difference]: Without dead ends: 15 [2022-07-12 02:32:07,202 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 02:32:07,203 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 1 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 02:32:07,203 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 38 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 02:32:07,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-07-12 02:32:07,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-07-12 02:32:07,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 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-07-12 02:32:07,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2022-07-12 02:32:07,205 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 11 [2022-07-12 02:32:07,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 02:32:07,205 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-07-12 02:32:07,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:32:07,205 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-07-12 02:32:07,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-12 02:32:07,206 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 02:32:07,206 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 02:32:07,219 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-12 02:32:07,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 02:32:07,406 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 02:32:07,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 02:32:07,407 INFO L85 PathProgramCache]: Analyzing trace with hash 854582592, now seen corresponding path program 1 times [2022-07-12 02:32:07,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 02:32:07,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1303361199] [2022-07-12 02:32:07,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 02:32:07,407 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 02:32:07,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 02:32:07,408 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 02:32:07,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-12 02:32:07,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 02:32:07,613 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 02:32:07,614 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 02:32:07,642 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 02:32:07,642 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 02:32:07,682 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 02:32:07,682 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 02:32:07,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1303361199] [2022-07-12 02:32:07,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1303361199] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 02:32:07,682 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 02:32:07,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-07-12 02:32:07,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862358211] [2022-07-12 02:32:07,682 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 02:32:07,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 02:32:07,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 02:32:07,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 02:32:07,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-12 02:32:07,683 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:32:09,769 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 02:32:10,929 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 02:32:12,613 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 02:32:12,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 02:32:12,614 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2022-07-12 02:32:12,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 02:32:12,660 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-07-12 02:32:12,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 02:32:12,661 INFO L225 Difference]: With dead ends: 39 [2022-07-12 02:32:12,661 INFO L226 Difference]: Without dead ends: 35 [2022-07-12 02:32:12,662 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2022-07-12 02:32:12,663 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 28 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-07-12 02:32:12,663 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 34 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2022-07-12 02:32:12,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-07-12 02:32:12,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 23. [2022-07-12 02:32:12,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 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-07-12 02:32:12,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2022-07-12 02:32:12,671 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 13 [2022-07-12 02:32:12,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 02:32:12,672 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2022-07-12 02:32:12,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:32:12,672 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2022-07-12 02:32:12,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-12 02:32:12,672 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 02:32:12,672 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 02:32:12,687 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-12 02:32:12,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 02:32:12,884 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 02:32:12,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 02:32:12,884 INFO L85 PathProgramCache]: Analyzing trace with hash 723862385, now seen corresponding path program 1 times [2022-07-12 02:32:12,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 02:32:12,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1455984371] [2022-07-12 02:32:12,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 02:32:12,885 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 02:32:12,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 02:32:12,886 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 02:32:12,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-12 02:32:13,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 02:32:13,275 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 31 conjunts are in the unsatisfiable core [2022-07-12 02:32:13,277 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 02:32:16,272 INFO L356 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2022-07-12 02:32:16,272 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 439 treesize of output 215 [2022-07-12 02:32:23,992 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 02:32:23,992 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 02:32:34,382 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse3 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse1 (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#min~0#1.offset| .cse3)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse1) (fp.sub c_currentRoundingMode (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#max~0#1.offset| .cse3)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) .cse1)))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0)))) is different from false [2022-07-12 02:32:36,431 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse3 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse1 (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#min~0#1.offset| .cse3)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse1) (fp.sub c_currentRoundingMode (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#max~0#1.offset| .cse3)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) .cse1)))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0)))) is different from true [2022-07-12 02:32:50,022 WARN L833 $PredicateComparison]: unable to prove that (or (let ((.cse0 (let ((.cse3 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse1 (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#min~0#1.offset| .cse3)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse1) (fp.sub c_currentRoundingMode (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#max~0#1.offset| .cse3)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) .cse1)))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0)))) (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| |c_ULTIMATE.start_main_#t~mem9#1|))) is different from false [2022-07-12 02:32:52,073 WARN L855 $PredicateComparison]: unable to prove that (or (let ((.cse0 (let ((.cse3 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse1 (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#min~0#1.offset| .cse3)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse1) (fp.sub c_currentRoundingMode (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#max~0#1.offset| .cse3)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) .cse1)))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0)))) (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| |c_ULTIMATE.start_main_#t~mem9#1|))) is different from true [2022-07-12 02:33:05,357 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse2 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#max~0#1.offset| .cse4)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (or (let ((.cse0 (let ((.cse1 (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#min~0#1.offset| .cse4)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse1) (fp.sub c_currentRoundingMode .cse2 .cse1))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0)))) (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse2))))) is different from false [2022-07-12 02:33:07,406 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse4 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse2 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#max~0#1.offset| .cse4)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (or (let ((.cse0 (let ((.cse1 (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#min~0#1.offset| .cse4)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse1) (fp.sub c_currentRoundingMode .cse2 .cse1))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0)))) (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse2))))) is different from true [2022-07-12 02:33:23,926 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse4 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse0 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#max~0#1.offset| .cse4)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (or (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse0)) (let ((.cse1 (let ((.cse2 (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#min~0#1.offset| .cse4)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse2) (fp.sub c_currentRoundingMode .cse0 .cse2))))) (and (fp.leq .cse1 ((_ to_fp 8 24) c_currentRoundingMode 1.0)) (fp.geq .cse1 (_ +zero 8 24))))))) is different from true [2022-07-12 02:33:41,360 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse0 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#max~0#1.offset| .cse4)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (or (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse0)) (fp.leq |c_ULTIMATE.start_main_~t~0#1| |c_ULTIMATE.start_main_#t~mem9#1|) (let ((.cse1 (let ((.cse2 (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#min~0#1.offset| .cse4)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse2) (fp.sub c_currentRoundingMode .cse0 .cse2))))) (and (fp.leq .cse1 ((_ to_fp 8 24) c_currentRoundingMode 1.0)) (fp.geq .cse1 (_ +zero 8 24))))))) is different from false [2022-07-12 02:33:43,409 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse4 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse0 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#max~0#1.offset| .cse4)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (or (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse0)) (fp.leq |c_ULTIMATE.start_main_~t~0#1| |c_ULTIMATE.start_main_#t~mem9#1|) (let ((.cse1 (let ((.cse2 (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#min~0#1.offset| .cse4)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse2) (fp.sub c_currentRoundingMode .cse0 .cse2))))) (and (fp.leq .cse1 ((_ to_fp 8 24) c_currentRoundingMode 1.0)) (fp.geq .cse1 (_ +zero 8 24))))))) is different from true