./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-benchs/interpolation.c.p+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version eb692b52 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.p+cfa-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 198a885d453136e0f485e10bae010eb2ed68236b2d57919bf162df9bdad27ee6 --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 13:37:37,122 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 13:37:37,127 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 13:37:37,159 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 13:37:37,159 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 13:37:37,160 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 13:37:37,161 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 13:37:37,162 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 13:37:37,164 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 13:37:37,164 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 13:37:37,165 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 13:37:37,166 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 13:37:37,166 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 13:37:37,167 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 13:37:37,167 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 13:37:37,168 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 13:37:37,169 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 13:37:37,169 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 13:37:37,171 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 13:37:37,172 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 13:37:37,173 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 13:37:37,179 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 13:37:37,180 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 13:37:37,182 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 13:37:37,184 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 13:37:37,187 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 13:37:37,190 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 13:37:37,190 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 13:37:37,191 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 13:37:37,191 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 13:37:37,191 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 13:37:37,192 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 13:37:37,193 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 13:37:37,193 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 13:37:37,194 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 13:37:37,195 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 13:37:37,198 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 13:37:37,198 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 13:37:37,198 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 13:37:37,199 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 13:37:37,199 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 13:37:37,200 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 13:37:37,202 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-19 13:37:37,221 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 13:37:37,221 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 13:37:37,222 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 13:37:37,222 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 13:37:37,222 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 13:37:37,222 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 13:37:37,223 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 13:37:37,223 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 13:37:37,223 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 13:37:37,223 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 13:37:37,223 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 13:37:37,224 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 13:37:37,224 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 13:37:37,224 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 13:37:37,224 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 13:37:37,224 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 13:37:37,224 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 13:37:37,224 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 13:37:37,224 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 13:37:37,225 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 13:37:37,225 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 13:37:37,225 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 13:37:37,225 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 13:37:37,225 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 13:37:37,225 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 13:37:37,226 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 13:37:37,226 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 13:37:37,226 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 13:37:37,226 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 13:37:37,226 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 13:37:37,226 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 13:37:37,226 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 13:37:37,226 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 13:37:37,227 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 -> 198a885d453136e0f485e10bae010eb2ed68236b2d57919bf162df9bdad27ee6 [2022-07-19 13:37:37,392 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 13:37:37,410 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 13:37:37,412 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 13:37:37,413 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 13:37:37,414 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 13:37:37,416 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/interpolation.c.p+cfa-reducer.c [2022-07-19 13:37:37,466 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50ffc919a/0b0806090c6747a4ba2ee5978eb4b689/FLAGfe3654177 [2022-07-19 13:37:37,846 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 13:37:37,847 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/interpolation.c.p+cfa-reducer.c [2022-07-19 13:37:37,853 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50ffc919a/0b0806090c6747a4ba2ee5978eb4b689/FLAGfe3654177 [2022-07-19 13:37:37,869 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50ffc919a/0b0806090c6747a4ba2ee5978eb4b689 [2022-07-19 13:37:37,871 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 13:37:37,873 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 13:37:37,874 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 13:37:37,874 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 13:37:37,876 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 13:37:37,877 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 01:37:37" (1/1) ... [2022-07-19 13:37:37,877 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d4a5b7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:37:37, skipping insertion in model container [2022-07-19 13:37:37,878 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 01:37:37" (1/1) ... [2022-07-19 13:37:37,883 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 13:37:37,898 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 13:37:38,057 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.p+cfa-reducer.c[1306,1319] [2022-07-19 13:37:38,065 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 13:37:38,072 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 13:37:38,094 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.p+cfa-reducer.c[1306,1319] [2022-07-19 13:37:38,103 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 13:37:38,113 INFO L208 MainTranslator]: Completed translation [2022-07-19 13:37:38,114 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:37:38 WrapperNode [2022-07-19 13:37:38,114 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 13:37:38,115 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 13:37:38,116 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 13:37:38,116 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 13:37:38,121 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:37:38" (1/1) ... [2022-07-19 13:37:38,132 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:37:38" (1/1) ... [2022-07-19 13:37:38,151 INFO L137 Inliner]: procedures = 18, calls = 33, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 99 [2022-07-19 13:37:38,152 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 13:37:38,153 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 13:37:38,153 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 13:37:38,153 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 13:37:38,158 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:37:38" (1/1) ... [2022-07-19 13:37:38,159 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:37:38" (1/1) ... [2022-07-19 13:37:38,162 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:37:38" (1/1) ... [2022-07-19 13:37:38,162 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:37:38" (1/1) ... [2022-07-19 13:37:38,175 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:37:38" (1/1) ... [2022-07-19 13:37:38,177 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:37:38" (1/1) ... [2022-07-19 13:37:38,181 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:37:38" (1/1) ... [2022-07-19 13:37:38,184 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 13:37:38,185 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 13:37:38,185 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 13:37:38,186 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 13:37:38,186 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:37:38" (1/1) ... [2022-07-19 13:37:38,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 13:37:38,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 13:37:38,212 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-19 13:37:38,220 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-19 13:37:38,238 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 13:37:38,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 13:37:38,239 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-19 13:37:38,239 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-07-19 13:37:38,239 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 13:37:38,239 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 13:37:38,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2022-07-19 13:37:38,240 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-19 13:37:38,291 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 13:37:38,293 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 13:37:38,453 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 13:37:38,457 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 13:37:38,457 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-19 13:37:38,458 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 01:37:38 BoogieIcfgContainer [2022-07-19 13:37:38,459 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 13:37:38,460 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 13:37:38,460 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 13:37:38,462 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 13:37:38,475 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 01:37:37" (1/3) ... [2022-07-19 13:37:38,478 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4534deb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 01:37:38, skipping insertion in model container [2022-07-19 13:37:38,478 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:37:38" (2/3) ... [2022-07-19 13:37:38,479 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4534deb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 01:37:38, skipping insertion in model container [2022-07-19 13:37:38,479 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 01:37:38" (3/3) ... [2022-07-19 13:37:38,480 INFO L111 eAbstractionObserver]: Analyzing ICFG interpolation.c.p+cfa-reducer.c [2022-07-19 13:37:38,491 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 13:37:38,491 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 13:37:38,552 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 13:37:38,557 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@7174377c, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4e4cf97e [2022-07-19 13:37:38,557 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 13:37:38,568 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 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-19 13:37:38,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-19 13:37:38,581 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 13:37:38,581 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 13:37:38,582 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 13:37:38,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 13:37:38,591 INFO L85 PathProgramCache]: Analyzing trace with hash 83921358, now seen corresponding path program 1 times [2022-07-19 13:37:38,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 13:37:38,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596050640] [2022-07-19 13:37:38,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 13:37:38,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 13:37:38,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 13:37:38,800 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-19 13:37:38,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 13:37:38,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596050640] [2022-07-19 13:37:38,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596050640] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 13:37:38,802 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 13:37:38,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 13:37:38,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422744482] [2022-07-19 13:37:38,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 13:37:38,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 13:37:38,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 13:37:38,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 13:37:38,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 13:37:38,832 INFO L87 Difference]: Start difference. First operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 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) Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 13:37:38,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 13:37:38,910 INFO L93 Difference]: Finished difference Result 51 states and 61 transitions. [2022-07-19 13:37:38,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 13:37:38,912 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-19 13:37:38,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 13:37:38,917 INFO L225 Difference]: With dead ends: 51 [2022-07-19 13:37:38,917 INFO L226 Difference]: Without dead ends: 27 [2022-07-19 13:37:38,920 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-19 13:37:38,926 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 39 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 13:37:38,926 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 85 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 13:37:38,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-07-19 13:37:38,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 16. [2022-07-19 13:37:38,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 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-19 13:37:38,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2022-07-19 13:37:38,950 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 20 transitions. Word has length 12 [2022-07-19 13:37:38,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 13:37:38,951 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 20 transitions. [2022-07-19 13:37:38,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 13:37:38,951 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 20 transitions. [2022-07-19 13:37:38,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-19 13:37:38,952 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 13:37:38,952 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 13:37:38,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 13:37:38,953 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 13:37:38,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 13:37:38,954 INFO L85 PathProgramCache]: Analyzing trace with hash 100932019, now seen corresponding path program 1 times [2022-07-19 13:37:38,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 13:37:38,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061881530] [2022-07-19 13:37:38,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 13:37:38,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 13:37:38,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 13:37:39,015 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-19 13:37:39,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 13:37:39,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061881530] [2022-07-19 13:37:39,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061881530] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 13:37:39,017 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 13:37:39,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 13:37:39,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561088928] [2022-07-19 13:37:39,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 13:37:39,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 13:37:39,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 13:37:39,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 13:37:39,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 13:37:39,020 INFO L87 Difference]: Start difference. First operand 16 states and 20 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 13:37:39,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 13:37:39,034 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2022-07-19 13:37:39,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 13:37:39,035 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-19 13:37:39,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 13:37:39,036 INFO L225 Difference]: With dead ends: 34 [2022-07-19 13:37:39,036 INFO L226 Difference]: Without dead ends: 26 [2022-07-19 13:37:39,039 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-19 13:37:39,041 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 10 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 33 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-19 13:37:39,041 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 33 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 13:37:39,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-07-19 13:37:39,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 17. [2022-07-19 13:37:39,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.3125) internal successors, (21), 16 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-19 13:37:39,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2022-07-19 13:37:39,049 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 12 [2022-07-19 13:37:39,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 13:37:39,050 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2022-07-19 13:37:39,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 13:37:39,052 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2022-07-19 13:37:39,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-19 13:37:39,053 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 13:37:39,053 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 13:37:39,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-19 13:37:39,054 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 13:37:39,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 13:37:39,056 INFO L85 PathProgramCache]: Analyzing trace with hash 10142420, now seen corresponding path program 1 times [2022-07-19 13:37:39,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 13:37:39,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696063327] [2022-07-19 13:37:39,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 13:37:39,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 13:37:39,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-19 13:37:39,078 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-19 13:37:39,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-19 13:37:39,107 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-19 13:37:39,107 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-19 13:37:39,108 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-19 13:37:39,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-19 13:37:39,111 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-07-19 13:37:39,115 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-19 13:37:39,142 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.07 01:37:39 BoogieIcfgContainer [2022-07-19 13:37:39,142 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-19 13:37:39,144 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-19 13:37:39,144 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-19 13:37:39,145 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-19 13:37:39,145 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 01:37:38" (3/4) ... [2022-07-19 13:37:39,147 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-19 13:37:39,147 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-19 13:37:39,148 INFO L158 Benchmark]: Toolchain (without parser) took 1275.14ms. Allocated memory is still 132.1MB. Free memory was 96.2MB in the beginning and 53.6MB in the end (delta: 42.6MB). Peak memory consumption was 40.9MB. Max. memory is 16.1GB. [2022-07-19 13:37:39,148 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 79.7MB. Free memory is still 39.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 13:37:39,149 INFO L158 Benchmark]: CACSL2BoogieTranslator took 240.37ms. Allocated memory is still 132.1MB. Free memory was 95.9MB in the beginning and 104.0MB in the end (delta: -8.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-19 13:37:39,149 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.57ms. Allocated memory is still 132.1MB. Free memory was 104.0MB in the beginning and 101.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-19 13:37:39,153 INFO L158 Benchmark]: Boogie Preprocessor took 31.37ms. Allocated memory is still 132.1MB. Free memory was 101.9MB in the beginning and 101.1MB in the end (delta: 742.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 13:37:39,153 INFO L158 Benchmark]: RCFGBuilder took 273.75ms. Allocated memory is still 132.1MB. Free memory was 101.1MB in the beginning and 90.0MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-19 13:37:39,153 INFO L158 Benchmark]: TraceAbstraction took 682.88ms. Allocated memory is still 132.1MB. Free memory was 89.3MB in the beginning and 54.4MB in the end (delta: 34.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2022-07-19 13:37:39,153 INFO L158 Benchmark]: Witness Printer took 3.26ms. Allocated memory is still 132.1MB. Free memory was 54.4MB in the beginning and 53.6MB in the end (delta: 744.5kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-19 13:37:39,155 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.17ms. Allocated memory is still 79.7MB. Free memory is still 39.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 240.37ms. Allocated memory is still 132.1MB. Free memory was 95.9MB in the beginning and 104.0MB in the end (delta: -8.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.57ms. Allocated memory is still 132.1MB. Free memory was 104.0MB in the beginning and 101.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.37ms. Allocated memory is still 132.1MB. Free memory was 101.9MB in the beginning and 101.1MB in the end (delta: 742.4kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 273.75ms. Allocated memory is still 132.1MB. Free memory was 101.1MB in the beginning and 90.0MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 682.88ms. Allocated memory is still 132.1MB. Free memory was 89.3MB in the beginning and 54.4MB in the end (delta: 34.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Witness Printer took 3.26ms. Allocated memory is still 132.1MB. Free memory was 54.4MB in the beginning and 53.6MB in the end (delta: 744.5kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 51]: 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 33, overapproximation of someBinaryDOUBLEComparisonOperation at line 38, overapproximation of to_real at line 17, overapproximation of someBinaryArithmeticFLOAToperation at line 36. Possible FailurePath: [L1] int __return_main; VAL [__return_main=0] [L14] int main__i; [L15] float main__z; [L16] float main__t; [L17] float main__min[5] = { 5, 10, 12, 30, 150 }; [L18] float main__max[5] = { 10, 12, 30, 150, 300 }; [L19] main__t = __VERIFIER_nondet_float() [L20] int main____CPAchecker_TMP_0; [L21] EXPR main__min[0] VAL [__return_main=0, main__max={5:0}, main__min={4:0}, main__min[0]=49] [L21] COND TRUE main__t >= (main__min[0]) [L23] EXPR main__max[4UL] VAL [__return_main=0, main__max={5:0}, main__max[4UL]=51, main__min={4:0}] [L23] COND TRUE main__t <= (main__max[4UL]) [L25] main____CPAchecker_TMP_0 = 1 VAL [__return_main=0, main____CPAchecker_TMP_0=1, main__max={5:0}, main__min={4:0}] [L27] COND TRUE main____CPAchecker_TMP_0 != 0 [L29] main__i = 0 VAL [__return_main=0, main____CPAchecker_TMP_0=1, main__i=0, main__max={5:0}, main__min={4:0}] [L31] COND TRUE main__i < 5UL [L33] EXPR main__max[main__i] VAL [__return_main=0, main____CPAchecker_TMP_0=1, main__i=0, main__max={5:0}, main__max[main__i]=50, main__min={4:0}] [L33] COND TRUE main__t <= (main__max[main__i]) [L36] EXPR main__min[main__i] [L36] EXPR main__max[main__i] [L36] EXPR main__min[main__i] [L36] main__z = (main__t - (main__min[main__i])) / ((main__max[main__i]) - (main__min[main__i])) [L37] int main____CPAchecker_TMP_1; VAL [__return_main=0, main____CPAchecker_TMP_0=1, main__i=0, main__max={5:0}, main__min={4:0}] [L38] COND FALSE !(main__z >= 0.0) VAL [__return_main=0, main____CPAchecker_TMP_0=1, main__i=0, main__max={5:0}, main__min={4:0}] [L63] main____CPAchecker_TMP_1 = 0 VAL [__return_main=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=0, main__i=0, main__max={5:0}, main__min={4:0}] [L45] int __tmp_1; [L46] __tmp_1 = main____CPAchecker_TMP_1 [L47] int __VERIFIER_assert__cond; [L48] __VERIFIER_assert__cond = __tmp_1 VAL [__return_main=0, __tmp_1=0, __VERIFIER_assert__cond=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=0, main__i=0, main__max={5:0}, main__min={4:0}] [L49] COND TRUE __VERIFIER_assert__cond == 0 VAL [__return_main=0, __tmp_1=0, __VERIFIER_assert__cond=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=0, main__i=0, main__max={5:0}, main__min={4:0}] [L51] reach_error() VAL [__return_main=0, __tmp_1=0, __VERIFIER_assert__cond=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=0, main__i=0, main__max={5:0}, main__min={4:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 19 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.6s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 49 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 49 mSDsluCounter, 118 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 76 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 24 IncrementalHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 42 mSDtfsCounter, 24 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19occurred in iteration=0, InterpolantAutomatonStates: 12, 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, 20 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 37 NumberOfCodeBlocks, 37 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 22 ConstructedInterpolants, 0 QuantifiedInterpolants, 32 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-19 13:37:39,185 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-benchs/interpolation.c.p+cfa-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 198a885d453136e0f485e10bae010eb2ed68236b2d57919bf162df9bdad27ee6 --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 13:37:40,870 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 13:37:40,871 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 13:37:40,905 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 13:37:40,906 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 13:37:40,906 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 13:37:40,907 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 13:37:40,909 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 13:37:40,910 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 13:37:40,911 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 13:37:40,911 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 13:37:40,912 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 13:37:40,912 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 13:37:40,913 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 13:37:40,914 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 13:37:40,915 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 13:37:40,915 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 13:37:40,916 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 13:37:40,917 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 13:37:40,918 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 13:37:40,919 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 13:37:40,920 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 13:37:40,928 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 13:37:40,930 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 13:37:40,932 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 13:37:40,936 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 13:37:40,937 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 13:37:40,937 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 13:37:40,938 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 13:37:40,938 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 13:37:40,939 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 13:37:40,939 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 13:37:40,942 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 13:37:40,942 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 13:37:40,943 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 13:37:40,944 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 13:37:40,947 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 13:37:40,947 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 13:37:40,947 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 13:37:40,948 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 13:37:40,948 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 13:37:40,949 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 13:37:40,950 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-19 13:37:40,972 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 13:37:40,973 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 13:37:40,973 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 13:37:40,973 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 13:37:40,974 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 13:37:40,974 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 13:37:40,975 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 13:37:40,975 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 13:37:40,975 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 13:37:40,975 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 13:37:40,976 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 13:37:40,976 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 13:37:40,976 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 13:37:40,976 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 13:37:40,976 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 13:37:40,976 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 13:37:40,977 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-19 13:37:40,977 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-19 13:37:40,977 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-19 13:37:40,977 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 13:37:40,977 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 13:37:40,977 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 13:37:40,977 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 13:37:40,978 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 13:37:40,978 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 13:37:40,978 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 13:37:40,978 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 13:37:40,978 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 13:37:40,978 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 13:37:40,978 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 13:37:40,979 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-19 13:37:40,979 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-19 13:37:40,979 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 13:37:40,979 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 13:37:40,980 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 13:37:40,980 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-19 13:37:40,980 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 -> 198a885d453136e0f485e10bae010eb2ed68236b2d57919bf162df9bdad27ee6 [2022-07-19 13:37:41,231 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 13:37:41,253 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 13:37:41,255 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 13:37:41,257 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 13:37:41,258 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 13:37:41,259 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/interpolation.c.p+cfa-reducer.c [2022-07-19 13:37:41,305 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fca52c39c/e86a0ba2c9be49bb9b40645e54fe029b/FLAG44ff1df32 [2022-07-19 13:37:41,635 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 13:37:41,636 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/interpolation.c.p+cfa-reducer.c [2022-07-19 13:37:41,641 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fca52c39c/e86a0ba2c9be49bb9b40645e54fe029b/FLAG44ff1df32 [2022-07-19 13:37:42,080 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fca52c39c/e86a0ba2c9be49bb9b40645e54fe029b [2022-07-19 13:37:42,082 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 13:37:42,084 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 13:37:42,085 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 13:37:42,085 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 13:37:42,088 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 13:37:42,088 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 01:37:42" (1/1) ... [2022-07-19 13:37:42,090 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a2cdf99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:37:42, skipping insertion in model container [2022-07-19 13:37:42,090 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 01:37:42" (1/1) ... [2022-07-19 13:37:42,094 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 13:37:42,106 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 13:37:42,219 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.p+cfa-reducer.c[1306,1319] [2022-07-19 13:37:42,229 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 13:37:42,262 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 13:37:42,291 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.p+cfa-reducer.c[1306,1319] [2022-07-19 13:37:42,294 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 13:37:42,309 INFO L208 MainTranslator]: Completed translation [2022-07-19 13:37:42,312 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:37:42 WrapperNode [2022-07-19 13:37:42,312 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 13:37:42,313 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 13:37:42,313 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 13:37:42,314 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 13:37:42,318 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:37:42" (1/1) ... [2022-07-19 13:37:42,339 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:37:42" (1/1) ... [2022-07-19 13:37:42,361 INFO L137 Inliner]: procedures = 19, calls = 33, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 100 [2022-07-19 13:37:42,361 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 13:37:42,362 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 13:37:42,362 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 13:37:42,363 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 13:37:42,368 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:37:42" (1/1) ... [2022-07-19 13:37:42,369 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:37:42" (1/1) ... [2022-07-19 13:37:42,376 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:37:42" (1/1) ... [2022-07-19 13:37:42,376 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:37:42" (1/1) ... [2022-07-19 13:37:42,392 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:37:42" (1/1) ... [2022-07-19 13:37:42,395 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:37:42" (1/1) ... [2022-07-19 13:37:42,403 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:37:42" (1/1) ... [2022-07-19 13:37:42,408 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 13:37:42,410 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 13:37:42,411 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 13:37:42,411 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 13:37:42,412 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:37:42" (1/1) ... [2022-07-19 13:37:42,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 13:37:42,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 13:37:42,435 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-19 13:37:42,454 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-19 13:37:42,465 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 13:37:42,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4 [2022-07-19 13:37:42,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-19 13:37:42,466 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-19 13:37:42,466 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2022-07-19 13:37:42,467 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 13:37:42,467 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 13:37:42,467 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-19 13:37:42,527 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 13:37:42,528 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 13:37:43,078 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 13:37:43,082 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 13:37:43,083 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-19 13:37:43,084 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 01:37:43 BoogieIcfgContainer [2022-07-19 13:37:43,084 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 13:37:43,085 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 13:37:43,085 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 13:37:43,087 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 13:37:43,087 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 01:37:42" (1/3) ... [2022-07-19 13:37:43,088 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50a023d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 01:37:43, skipping insertion in model container [2022-07-19 13:37:43,088 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:37:42" (2/3) ... [2022-07-19 13:37:43,088 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50a023d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 01:37:43, skipping insertion in model container [2022-07-19 13:37:43,088 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 01:37:43" (3/3) ... [2022-07-19 13:37:43,089 INFO L111 eAbstractionObserver]: Analyzing ICFG interpolation.c.p+cfa-reducer.c [2022-07-19 13:37:43,098 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 13:37:43,098 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 13:37:43,135 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 13:37:43,140 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@117eb51f, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4f17a4f8 [2022-07-19 13:37:43,140 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 13:37:43,143 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 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-19 13:37:43,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-19 13:37:43,147 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 13:37:43,147 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 13:37:43,148 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 13:37:43,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 13:37:43,151 INFO L85 PathProgramCache]: Analyzing trace with hash 83921358, now seen corresponding path program 1 times [2022-07-19 13:37:43,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 13:37:43,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [930953683] [2022-07-19 13:37:43,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 13:37:43,160 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 13:37:43,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 13:37:43,163 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-19 13:37:43,164 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-19 13:37:43,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 13:37:43,406 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-19 13:37:43,409 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 13:37:43,457 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-19 13:37:43,457 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 13:37:43,457 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 13:37:43,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [930953683] [2022-07-19 13:37:43,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [930953683] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 13:37:43,459 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 13:37:43,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 13:37:43,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174215833] [2022-07-19 13:37:43,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 13:37:43,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 13:37:43,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 13:37:43,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 13:37:43,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 13:37:43,488 INFO L87 Difference]: Start difference. First operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 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) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 13:37:45,617 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 13:37:45,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 13:37:45,662 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2022-07-19 13:37:45,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 13:37:45,664 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-19 13:37:45,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 13:37:45,669 INFO L225 Difference]: With dead ends: 33 [2022-07-19 13:37:45,669 INFO L226 Difference]: Without dead ends: 19 [2022-07-19 13:37:45,675 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 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-19 13:37:45,677 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 2 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 41 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-19 13:37:45,678 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 41 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-19 13:37:45,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-07-19 13:37:45,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2022-07-19 13:37:45,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.375) 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-19 13:37:45,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2022-07-19 13:37:45,697 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 22 transitions. Word has length 12 [2022-07-19 13:37:45,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 13:37:45,697 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 22 transitions. [2022-07-19 13:37:45,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 13:37:45,698 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 22 transitions. [2022-07-19 13:37:45,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-19 13:37:45,698 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 13:37:45,698 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 13:37:45,716 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-07-19 13:37:45,911 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-19 13:37:45,911 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 13:37:45,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 13:37:45,912 INFO L85 PathProgramCache]: Analyzing trace with hash -6868241, now seen corresponding path program 1 times [2022-07-19 13:37:45,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 13:37:45,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [887587765] [2022-07-19 13:37:45,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 13:37:45,913 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 13:37:45,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 13:37:45,914 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-19 13:37:45,916 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-19 13:37:46,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 13:37:46,153 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-19 13:37:46,154 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 13:37:46,183 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-19 13:37:46,183 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 13:37:46,184 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 13:37:46,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [887587765] [2022-07-19 13:37:46,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [887587765] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 13:37:46,184 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 13:37:46,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 13:37:46,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988235891] [2022-07-19 13:37:46,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 13:37:46,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 13:37:46,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 13:37:46,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 13:37:46,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 13:37:46,186 INFO L87 Difference]: Start difference. First operand 17 states and 22 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 13:37:48,288 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 13:37:48,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 13:37:48,359 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2022-07-19 13:37:48,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 13:37:48,360 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-07-19 13:37:48,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 13:37:48,361 INFO L225 Difference]: With dead ends: 21 [2022-07-19 13:37:48,361 INFO L226 Difference]: Without dead ends: 17 [2022-07-19 13:37:48,361 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 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-19 13:37:48,362 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 1 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-19 13:37:48,362 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 54 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-19 13:37:48,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-07-19 13:37:48,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-07-19 13:37:48,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.3125) internal successors, (21), 16 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-19 13:37:48,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2022-07-19 13:37:48,364 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 13 [2022-07-19 13:37:48,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 13:37:48,365 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2022-07-19 13:37:48,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 13:37:48,365 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2022-07-19 13:37:48,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-19 13:37:48,365 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 13:37:48,365 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 13:37:48,380 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-19 13:37:48,567 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-19 13:37:48,568 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 13:37:48,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 13:37:48,568 INFO L85 PathProgramCache]: Analyzing trace with hash 10142420, now seen corresponding path program 1 times [2022-07-19 13:37:48,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 13:37:48,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1482577930] [2022-07-19 13:37:48,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 13:37:48,569 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 13:37:48,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 13:37:48,570 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-19 13:37:48,573 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-19 13:37:48,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 13:37:48,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-19 13:37:48,839 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 13:37:50,660 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-19 13:37:50,661 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 178 treesize of output 86 [2022-07-19 13:38:01,840 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_2 (_ BitVec 32))) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32)) (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2)))) (exists ((v_arrayElimCell_1 (_ BitVec 32)) (|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_3 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)))) (and (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32)) .cse0) (= .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))) (= (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |ULTIMATE.start_main_~main__t~0#1| .cse1) (fp.sub c_currentRoundingMode .cse0 .cse1)) |c_ULTIMATE.start_main_~main__z~0#1|) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse0) (fp.geq |ULTIMATE.start_main_~main__t~0#1| .cse1)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-07-19 13:38:24,669 WARN L833 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1 (_ BitVec 32)) (|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_3 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3)))) (and (not (fp.geq ((_ to_fp 11 53) roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~main__t~0#1| .cse0) (fp.sub roundNearestTiesToEven .cse1 .cse0))) (_ +zero 11 53))) (= .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32))) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse1) (fp.geq |ULTIMATE.start_main_~main__t~0#1| .cse0) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32)) .cse1)))) is different from false [2022-07-19 13:38:26,694 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1 (_ BitVec 32)) (|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_3 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3)))) (and (not (fp.geq ((_ to_fp 11 53) roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~main__t~0#1| .cse0) (fp.sub roundNearestTiesToEven .cse1 .cse0))) (_ +zero 11 53))) (= .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32))) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse1) (fp.geq |ULTIMATE.start_main_~main__t~0#1| .cse0) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32)) .cse1)))) is different from true [2022-07-19 13:39:28,602 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-19 13:39:28,603 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 13:39:28,603 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 13:39:28,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1482577930] [2022-07-19 13:39:28,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1482577930] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 13:39:28,603 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 13:39:28,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-19 13:39:28,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527876734] [2022-07-19 13:39:28,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 13:39:28,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-19 13:39:28,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 13:39:28,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-19 13:39:28,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=47, Unknown=3, NotChecked=30, Total=110 [2022-07-19 13:39:28,604 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand has 11 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 13:39:30,931 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 13:39:31,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 13:39:31,120 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2022-07-19 13:39:31,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-19 13:39:31,126 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-07-19 13:39:31,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 13:39:31,126 INFO L225 Difference]: With dead ends: 30 [2022-07-19 13:39:31,126 INFO L226 Difference]: Without dead ends: 25 [2022-07-19 13:39:31,127 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=30, Invalid=47, Unknown=3, NotChecked=30, Total=110 [2022-07-19 13:39:31,127 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 14 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 44 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-07-19 13:39:31,128 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 21 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 55 Invalid, 1 Unknown, 44 Unchecked, 2.5s Time] [2022-07-19 13:39:31,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-07-19 13:39:31,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2022-07-19 13:39:31,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 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-19 13:39:31,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2022-07-19 13:39:31,136 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 27 transitions. Word has length 13 [2022-07-19 13:39:31,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 13:39:31,136 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 27 transitions. [2022-07-19 13:39:31,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 13:39:31,136 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2022-07-19 13:39:31,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-19 13:39:31,137 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 13:39:31,137 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 13:39:31,161 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-07-19 13:39:31,349 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-19 13:39:31,350 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 13:39:31,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 13:39:31,350 INFO L85 PathProgramCache]: Analyzing trace with hash 2097179417, now seen corresponding path program 1 times [2022-07-19 13:39:31,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 13:39:31,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1523051868] [2022-07-19 13:39:31,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 13:39:31,351 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 13:39:31,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 13:39:31,352 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-19 13:39:31,353 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-19 13:39:31,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 13:39:31,574 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-19 13:39:31,576 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 13:39:31,590 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-19 13:39:31,590 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 13:39:31,590 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 13:39:31,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1523051868] [2022-07-19 13:39:31,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1523051868] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 13:39:31,591 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 13:39:31,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 13:39:31,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695204199] [2022-07-19 13:39:31,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 13:39:31,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 13:39:31,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 13:39:31,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 13:39:31,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 13:39:31,592 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 13:39:31,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 13:39:31,613 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2022-07-19 13:39:31,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 13:39:31,614 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-07-19 13:39:31,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 13:39:31,614 INFO L225 Difference]: With dead ends: 32 [2022-07-19 13:39:31,614 INFO L226 Difference]: Without dead ends: 19 [2022-07-19 13:39:31,614 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 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-19 13:39:31,615 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 13:39:31,616 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 13:39:31,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-07-19 13:39:31,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-07-19 13:39:31,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 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-19 13:39:31,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2022-07-19 13:39:31,620 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 13 [2022-07-19 13:39:31,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 13:39:31,620 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2022-07-19 13:39:31,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 13:39:31,621 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-07-19 13:39:31,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-19 13:39:31,621 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 13:39:31,621 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 13:39:31,637 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-19 13:39:31,831 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-19 13:39:31,831 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 13:39:31,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 13:39:31,832 INFO L85 PathProgramCache]: Analyzing trace with hash -202431920, now seen corresponding path program 1 times [2022-07-19 13:39:31,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 13:39:31,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [635899796] [2022-07-19 13:39:31,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 13:39:31,833 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 13:39:31,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 13:39:31,834 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-19 13:39:31,835 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-19 13:39:32,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 13:39:32,282 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-19 13:39:32,284 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 13:39:33,711 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-19 13:39:33,711 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 178 treesize of output 86 [2022-07-19 13:40:15,960 WARN L233 SmtUtils]: Spent 17.09s on a formula simplification. DAG size of input: 39 DAG size of output: 30 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-19 13:40:33,625 WARN L833 $PredicateComparison]: unable to prove that (and (fp.geq ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__z~0#1|) (_ +zero 11 53)) (exists ((|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_6 (_ BitVec 32)) (v_arrayElimCell_4 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)))) (and (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32)) .cse0) (= |c_ULTIMATE.start_main_~main__z~0#1| (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |ULTIMATE.start_main_~main__t~0#1| .cse1) (fp.sub c_currentRoundingMode .cse0 .cse1))) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)) .cse1) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse0) (fp.geq |ULTIMATE.start_main_~main__t~0#1| .cse1)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-07-19 13:41:00,668 WARN L833 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_6 (_ BitVec 32)) (v_arrayElimCell_4 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~main__t~0#1| .cse2) (fp.sub roundNearestTiesToEven .cse1 .cse2))))) (and (fp.geq .cse0 (_ +zero 11 53)) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32)) .cse1) (not (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32)) .cse2) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse1) (fp.geq |ULTIMATE.start_main_~main__t~0#1| .cse2))))) is different from false [2022-07-19 13:41:02,700 WARN L855 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_6 (_ BitVec 32)) (v_arrayElimCell_4 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~main__t~0#1| .cse2) (fp.sub roundNearestTiesToEven .cse1 .cse2))))) (and (fp.geq .cse0 (_ +zero 11 53)) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32)) .cse1) (not (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32)) .cse2) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse1) (fp.geq |ULTIMATE.start_main_~main__t~0#1| .cse2))))) is different from true [2022-07-19 13:41:53,618 WARN L833 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_6 (_ BitVec 32)) (v_arrayElimCell_4 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~main__t~0#1| .cse2) (fp.sub roundNearestTiesToEven .cse1 .cse2))))) (and (fp.geq .cse0 (_ +zero 11 53)) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32)) .cse1) (not (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32)) .cse2) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse1))))) is different from false [2022-07-19 13:41:55,651 WARN L855 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_6 (_ BitVec 32)) (v_arrayElimCell_4 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~main__t~0#1| .cse2) (fp.sub roundNearestTiesToEven .cse1 .cse2))))) (and (fp.geq .cse0 (_ +zero 11 53)) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32)) .cse1) (not (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32)) .cse2) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse1))))) is different from true [2022-07-19 13:42:18,491 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-19 13:42:18,492 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 13:42:18,492 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 13:42:18,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [635899796] [2022-07-19 13:42:18,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [635899796] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 13:42:18,492 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 13:42:18,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-19 13:42:18,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544135928] [2022-07-19 13:42:18,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 13:42:18,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-19 13:42:18,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 13:42:18,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-19 13:42:18,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=58, Unknown=9, NotChecked=54, Total=156 [2022-07-19 13:42:18,493 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 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-19 13:42:19,772 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 13:42:21,998 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|)) (.cse3 (let ((.cse7 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|) |c_ULTIMATE.start_main_~#main__min~0#1.offset|))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7))))) (and (= |c_ULTIMATE.start_main_~#main__min~0#1.offset| (_ bv0 32)) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32)) (let ((.cse0 (select .cse1 (bvadd |c_ULTIMATE.start_main_~#main__max~0#1.offset| (_ bv16 32))))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0)))) (= |c_ULTIMATE.start_main_~#main__max~0#1.offset| (_ bv0 32)) (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| (let ((.cse2 (select .cse1 (bvadd |c_ULTIMATE.start_main_~#main__max~0#1.offset| (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~main__i~0#1|))))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2)))) (fp.geq |c_ULTIMATE.start_main_~main__t~0#1| .cse3) (exists ((|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_6 (_ BitVec 32)) (v_arrayElimCell_4 (_ BitVec 32))) (let ((.cse4 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6))) (.cse5 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)))) (and (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32)) .cse4) (= |c_ULTIMATE.start_main_~main__z~0#1| (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |ULTIMATE.start_main_~main__t~0#1| .cse5) (fp.sub c_currentRoundingMode .cse4 .cse5))) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)) .cse5) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse4) (fp.geq |ULTIMATE.start_main_~main__t~0#1| .cse5)))) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32)) (let ((.cse6 (select .cse1 |c_ULTIMATE.start_main_~#main__max~0#1.offset|))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6)))) (= |c_ULTIMATE.start_main_~main__i~0#1| (_ bv0 32)) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)) .cse3) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2022-07-19 13:42:24,152 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 13:42:25,236 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 13:42:25,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 13:42:25,584 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-07-19 13:42:25,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-19 13:42:25,591 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 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 14 [2022-07-19 13:42:25,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 13:42:25,591 INFO L225 Difference]: With dead ends: 25 [2022-07-19 13:42:25,591 INFO L226 Difference]: Without dead ends: 17 [2022-07-19 13:42:25,591 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 48.5s TimeCoverageRelationStatistics Valid=37, Invalid=59, Unknown=10, NotChecked=76, Total=182 [2022-07-19 13:42:25,592 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 17 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 70 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-07-19 13:42:25,592 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 33 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 57 Invalid, 1 Unknown, 70 Unchecked, 5.0s Time] [2022-07-19 13:42:25,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-07-19 13:42:25,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-07-19 13:42:25,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 13:42:25,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-07-19 13:42:25,595 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 14 [2022-07-19 13:42:25,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 13:42:25,595 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-07-19 13:42:25,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 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-19 13:42:25,595 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-07-19 13:42:25,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-19 13:42:25,595 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 13:42:25,595 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 13:42:25,607 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Ended with exit code 0 [2022-07-19 13:42:25,803 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-19 13:42:25,804 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 13:42:25,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 13:42:25,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1048715671, now seen corresponding path program 1 times [2022-07-19 13:42:25,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 13:42:25,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2054340376] [2022-07-19 13:42:25,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 13:42:25,805 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 13:42:25,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 13:42:25,806 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-19 13:42:25,811 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-19 13:42:26,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 13:42:26,027 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-19 13:42:26,028 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 13:42:26,069 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-19 13:42:26,069 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 13:42:26,116 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-19 13:42:26,117 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 13:42:26,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2054340376] [2022-07-19 13:42:26,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2054340376] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 13:42:26,117 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 13:42:26,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-07-19 13:42:26,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520757817] [2022-07-19 13:42:26,118 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 13:42:26,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 13:42:26,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 13:42:26,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 13:42:26,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-19 13:42:26,119 INFO L87 Difference]: Start difference. First operand 17 states and 19 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-19 13:42:28,297 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 13:42:28,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 13:42:28,372 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2022-07-19 13:42:28,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 13:42:28,372 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 14 [2022-07-19 13:42:28,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 13:42:28,373 INFO L225 Difference]: With dead ends: 33 [2022-07-19 13:42:28,373 INFO L226 Difference]: Without dead ends: 25 [2022-07-19 13:42:28,374 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2022-07-19 13:42:28,374 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 10 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-19 13:42:28,375 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 37 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 17 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-19 13:42:28,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-07-19 13:42:28,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2022-07-19 13:42:28,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 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-19 13:42:28,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2022-07-19 13:42:28,379 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 14 [2022-07-19 13:42:28,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 13:42:28,379 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2022-07-19 13:42:28,379 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-19 13:42:28,379 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-07-19 13:42:28,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-19 13:42:28,380 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 13:42:28,380 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 13:42:28,395 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-07-19 13:42:28,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 13:42:28,592 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 13:42:28,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 13:42:28,592 INFO L85 PathProgramCache]: Analyzing trace with hash -673335440, now seen corresponding path program 1 times [2022-07-19 13:42:28,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 13:42:28,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1213053161] [2022-07-19 13:42:28,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 13:42:28,593 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 13:42:28,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 13:42:28,594 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 13:42:28,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-19 13:42:28,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 13:42:28,855 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-19 13:42:28,857 INFO L286 TraceCheckSpWp]: Computing forward predicates...