./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-benchs/drift_tenth.c.p+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 791161d1 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/drift_tenth.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 ee159be1ed42c29b70080447b490f7a1aeb72331afc90e5794e0e8d61cb20d74 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-22 13:45:20,004 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 13:45:20,006 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 13:45:20,047 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 13:45:20,047 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 13:45:20,049 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 13:45:20,050 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 13:45:20,054 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 13:45:20,056 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 13:45:20,057 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 13:45:20,058 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 13:45:20,060 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 13:45:20,061 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 13:45:20,063 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 13:45:20,064 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 13:45:20,065 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 13:45:20,068 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 13:45:20,073 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 13:45:20,075 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 13:45:20,077 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 13:45:20,081 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 13:45:20,082 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 13:45:20,082 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 13:45:20,083 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 13:45:20,084 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 13:45:20,087 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 13:45:20,088 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 13:45:20,088 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 13:45:20,089 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 13:45:20,089 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 13:45:20,090 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 13:45:20,091 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 13:45:20,092 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 13:45:20,092 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 13:45:20,093 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 13:45:20,094 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 13:45:20,094 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 13:45:20,095 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 13:45:20,095 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 13:45:20,095 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 13:45:20,096 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 13:45:20,098 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 13:45:20,099 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-22 13:45:20,119 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 13:45:20,119 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 13:45:20,120 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 13:45:20,120 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 13:45:20,121 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 13:45:20,121 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 13:45:20,122 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 13:45:20,123 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 13:45:20,123 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 13:45:20,123 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 13:45:20,123 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 13:45:20,124 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 13:45:20,124 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 13:45:20,124 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 13:45:20,124 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 13:45:20,125 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 13:45:20,125 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 13:45:20,125 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 13:45:20,125 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 13:45:20,125 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 13:45:20,126 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 13:45:20,126 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 13:45:20,126 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 13:45:20,126 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 13:45:20,126 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 13:45:20,127 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 13:45:20,127 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 13:45:20,127 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 13:45:20,127 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 13:45:20,127 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-22 13:45:20,128 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 13:45:20,128 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 13:45:20,128 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 13:45:20,128 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 -> ee159be1ed42c29b70080447b490f7a1aeb72331afc90e5794e0e8d61cb20d74 [2022-07-22 13:45:20,361 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 13:45:20,389 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 13:45:20,391 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 13:45:20,392 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 13:45:20,393 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 13:45:20,394 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/drift_tenth.c.p+cfa-reducer.c [2022-07-22 13:45:20,450 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10d9ff0b2/d661238e447f4bb0b24fba8a78014e83/FLAG4e0058fb8 [2022-07-22 13:45:20,836 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 13:45:20,837 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/drift_tenth.c.p+cfa-reducer.c [2022-07-22 13:45:20,843 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10d9ff0b2/d661238e447f4bb0b24fba8a78014e83/FLAG4e0058fb8 [2022-07-22 13:45:21,268 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10d9ff0b2/d661238e447f4bb0b24fba8a78014e83 [2022-07-22 13:45:21,270 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 13:45:21,273 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 13:45:21,274 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 13:45:21,275 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 13:45:21,277 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 13:45:21,278 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 01:45:21" (1/1) ... [2022-07-22 13:45:21,279 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@184c94f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:45:21, skipping insertion in model container [2022-07-22 13:45:21,279 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 01:45:21" (1/1) ... [2022-07-22 13:45:21,285 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 13:45:21,295 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 13:45:21,434 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/drift_tenth.c.p+cfa-reducer.c[721,734] [2022-07-22 13:45:21,437 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 13:45:21,443 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 13:45:21,460 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/drift_tenth.c.p+cfa-reducer.c[721,734] [2022-07-22 13:45:21,461 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 13:45:21,473 INFO L208 MainTranslator]: Completed translation [2022-07-22 13:45:21,473 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:45:21 WrapperNode [2022-07-22 13:45:21,474 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 13:45:21,475 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 13:45:21,475 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 13:45:21,476 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 13:45:21,481 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:45:21" (1/1) ... [2022-07-22 13:45:21,487 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:45:21" (1/1) ... [2022-07-22 13:45:21,499 INFO L137 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 30 [2022-07-22 13:45:21,499 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 13:45:21,500 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 13:45:21,500 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 13:45:21,500 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 13:45:21,505 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:45:21" (1/1) ... [2022-07-22 13:45:21,505 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:45:21" (1/1) ... [2022-07-22 13:45:21,506 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:45:21" (1/1) ... [2022-07-22 13:45:21,506 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:45:21" (1/1) ... [2022-07-22 13:45:21,509 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:45:21" (1/1) ... [2022-07-22 13:45:21,510 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:45:21" (1/1) ... [2022-07-22 13:45:21,510 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:45:21" (1/1) ... [2022-07-22 13:45:21,512 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 13:45:21,513 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 13:45:21,514 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 13:45:21,514 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 13:45:21,515 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:45:21" (1/1) ... [2022-07-22 13:45:21,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 13:45:21,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 13:45:21,544 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-22 13:45:21,546 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-22 13:45:21,570 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 13:45:21,571 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 13:45:21,571 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 13:45:21,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 13:45:21,616 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 13:45:21,618 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 13:45:21,673 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 13:45:21,678 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 13:45:21,680 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-22 13:45:21,681 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 01:45:21 BoogieIcfgContainer [2022-07-22 13:45:21,681 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 13:45:21,684 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 13:45:21,684 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 13:45:21,687 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 13:45:21,687 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 01:45:21" (1/3) ... [2022-07-22 13:45:21,689 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c7abd9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 01:45:21, skipping insertion in model container [2022-07-22 13:45:21,690 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:45:21" (2/3) ... [2022-07-22 13:45:21,690 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c7abd9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 01:45:21, skipping insertion in model container [2022-07-22 13:45:21,690 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 01:45:21" (3/3) ... [2022-07-22 13:45:21,691 INFO L111 eAbstractionObserver]: Analyzing ICFG drift_tenth.c.p+cfa-reducer.c [2022-07-22 13:45:21,702 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 13:45:21,702 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-22 13:45:21,739 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 13:45:21,745 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@5537b8ec, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5edb958c [2022-07-22 13:45:21,745 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-22 13:45:21,748 INFO L276 IsEmpty]: Start isEmpty. Operand has 9 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 13:45:21,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-22 13:45:21,753 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 13:45:21,753 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-22 13:45:21,754 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 13:45:21,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 13:45:21,759 INFO L85 PathProgramCache]: Analyzing trace with hash 28696774, now seen corresponding path program 1 times [2022-07-22 13:45:21,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 13:45:21,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672686942] [2022-07-22 13:45:21,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 13:45:21,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 13:45:21,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 13:45:21,914 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-22 13:45:21,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 13:45:21,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672686942] [2022-07-22 13:45:21,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672686942] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 13:45:21,916 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 13:45:21,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 13:45:21,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360922014] [2022-07-22 13:45:21,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 13:45:21,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 13:45:21,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 13:45:21,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 13:45:21,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 13:45:21,958 INFO L87 Difference]: Start difference. First operand has 9 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 13:45:21,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 13:45:21,979 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2022-07-22 13:45:21,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 13:45:21,997 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-07-22 13:45:21,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 13:45:22,002 INFO L225 Difference]: With dead ends: 16 [2022-07-22 13:45:22,003 INFO L226 Difference]: Without dead ends: 7 [2022-07-22 13:45:22,005 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-22 13:45:22,007 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 14 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-22 13:45:22,008 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 14 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 13:45:22,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2022-07-22 13:45:22,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2022-07-22 13:45:22,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 13:45:22,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2022-07-22 13:45:22,061 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2022-07-22 13:45:22,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 13:45:22,062 INFO L495 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2022-07-22 13:45:22,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 13:45:22,062 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2022-07-22 13:45:22,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-22 13:45:22,062 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 13:45:22,063 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-22 13:45:22,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-22 13:45:22,063 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 13:45:22,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 13:45:22,064 INFO L85 PathProgramCache]: Analyzing trace with hash 889537510, now seen corresponding path program 1 times [2022-07-22 13:45:22,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 13:45:22,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57194554] [2022-07-22 13:45:22,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 13:45:22,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 13:45:22,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 13:45:22,134 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-22 13:45:22,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 13:45:22,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57194554] [2022-07-22 13:45:22,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57194554] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 13:45:22,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1269732875] [2022-07-22 13:45:22,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 13:45:22,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 13:45:22,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 13:45:22,138 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 13:45:22,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-22 13:45:22,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 13:45:22,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-22 13:45:22,189 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 13:45:22,221 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-22 13:45:22,222 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 13:45:22,248 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-22 13:45:22,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1269732875] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 13:45:22,249 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 13:45:22,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-07-22 13:45:22,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623799597] [2022-07-22 13:45:22,250 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 13:45:22,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 13:45:22,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 13:45:22,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 13:45:22,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-07-22 13:45:22,252 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 13:45:22,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 13:45:22,265 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2022-07-22 13:45:22,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 13:45:22,266 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-07-22 13:45:22,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 13:45:22,266 INFO L225 Difference]: With dead ends: 13 [2022-07-22 13:45:22,267 INFO L226 Difference]: Without dead ends: 10 [2022-07-22 13:45:22,267 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-07-22 13:45:22,268 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 13:45:22,269 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 11 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 13:45:22,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2022-07-22 13:45:22,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2022-07-22 13:45:22,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 13:45:22,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2022-07-22 13:45:22,272 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 6 [2022-07-22 13:45:22,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 13:45:22,272 INFO L495 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2022-07-22 13:45:22,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 13:45:22,273 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2022-07-22 13:45:22,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-22 13:45:22,273 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 13:45:22,273 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1] [2022-07-22 13:45:22,296 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-22 13:45:22,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 13:45:22,490 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 13:45:22,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 13:45:22,491 INFO L85 PathProgramCache]: Analyzing trace with hash 201697478, now seen corresponding path program 2 times [2022-07-22 13:45:22,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 13:45:22,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633744955] [2022-07-22 13:45:22,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 13:45:22,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 13:45:22,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 13:45:22,573 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 13:45:22,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 13:45:22,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633744955] [2022-07-22 13:45:22,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633744955] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 13:45:22,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1349056275] [2022-07-22 13:45:22,579 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 13:45:22,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 13:45:22,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 13:45:22,580 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 13:45:22,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-22 13:45:22,625 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 13:45:22,625 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 13:45:22,626 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-22 13:45:22,628 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 13:45:22,663 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 13:45:22,664 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 13:45:22,743 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 13:45:22,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1349056275] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 13:45:22,744 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 13:45:22,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-07-22 13:45:22,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046032454] [2022-07-22 13:45:22,745 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 13:45:22,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-22 13:45:22,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 13:45:22,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-22 13:45:22,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-07-22 13:45:22,748 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 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-22 13:45:22,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 13:45:22,780 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2022-07-22 13:45:22,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-22 13:45:22,781 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 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 9 [2022-07-22 13:45:22,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 13:45:22,782 INFO L225 Difference]: With dead ends: 19 [2022-07-22 13:45:22,782 INFO L226 Difference]: Without dead ends: 16 [2022-07-22 13:45:22,784 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-07-22 13:45:22,787 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 13:45:22,789 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 17 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 13:45:22,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-07-22 13:45:22,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-07-22 13:45:22,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 13:45:22,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2022-07-22 13:45:22,793 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 9 [2022-07-22 13:45:22,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 13:45:22,793 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2022-07-22 13:45:22,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 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-22 13:45:22,794 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-07-22 13:45:22,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-22 13:45:22,794 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 13:45:22,794 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1] [2022-07-22 13:45:22,820 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-22 13:45:23,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-07-22 13:45:23,017 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 13:45:23,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 13:45:23,018 INFO L85 PathProgramCache]: Analyzing trace with hash -763767610, now seen corresponding path program 3 times [2022-07-22 13:45:23,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 13:45:23,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635247432] [2022-07-22 13:45:23,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 13:45:23,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 13:45:23,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 13:45:23,038 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 13:45:23,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 13:45:23,086 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 13:45:23,087 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-22 13:45:23,087 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-22 13:45:23,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-22 13:45:23,092 INFO L356 BasicCegarLoop]: Path program histogram: [3, 1] [2022-07-22 13:45:23,095 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-22 13:45:23,113 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.07 01:45:23 BoogieIcfgContainer [2022-07-22 13:45:23,114 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-22 13:45:23,114 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-22 13:45:23,114 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-22 13:45:23,114 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-22 13:45:23,115 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 01:45:21" (3/4) ... [2022-07-22 13:45:23,117 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-22 13:45:23,117 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-22 13:45:23,117 INFO L158 Benchmark]: Toolchain (without parser) took 1843.92ms. Allocated memory was 90.2MB in the beginning and 111.1MB in the end (delta: 21.0MB). Free memory was 59.6MB in the beginning and 64.0MB in the end (delta: -4.4MB). Peak memory consumption was 15.7MB. Max. memory is 16.1GB. [2022-07-22 13:45:23,118 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 90.2MB. Free memory was 46.8MB in the beginning and 46.7MB in the end (delta: 70.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 13:45:23,118 INFO L158 Benchmark]: CACSL2BoogieTranslator took 199.48ms. Allocated memory was 90.2MB in the beginning and 111.1MB in the end (delta: 21.0MB). Free memory was 59.6MB in the beginning and 87.8MB in the end (delta: -28.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-22 13:45:23,118 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.54ms. Allocated memory is still 111.1MB. Free memory was 87.8MB in the beginning and 86.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-22 13:45:23,119 INFO L158 Benchmark]: Boogie Preprocessor took 12.30ms. Allocated memory is still 111.1MB. Free memory was 86.3MB in the beginning and 85.4MB in the end (delta: 856.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 13:45:23,119 INFO L158 Benchmark]: RCFGBuilder took 168.66ms. Allocated memory is still 111.1MB. Free memory was 85.4MB in the beginning and 76.9MB in the end (delta: 8.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-22 13:45:23,119 INFO L158 Benchmark]: TraceAbstraction took 1429.85ms. Allocated memory is still 111.1MB. Free memory was 76.2MB in the beginning and 64.5MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-22 13:45:23,120 INFO L158 Benchmark]: Witness Printer took 2.57ms. Allocated memory is still 111.1MB. Free memory was 64.5MB in the beginning and 64.0MB in the end (delta: 433.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 13:45:23,121 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.20ms. Allocated memory is still 90.2MB. Free memory was 46.8MB in the beginning and 46.7MB in the end (delta: 70.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 199.48ms. Allocated memory was 90.2MB in the beginning and 111.1MB in the end (delta: 21.0MB). Free memory was 59.6MB in the beginning and 87.8MB in the end (delta: -28.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.54ms. Allocated memory is still 111.1MB. Free memory was 87.8MB in the beginning and 86.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 12.30ms. Allocated memory is still 111.1MB. Free memory was 86.3MB in the beginning and 85.4MB in the end (delta: 856.6kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 168.66ms. Allocated memory is still 111.1MB. Free memory was 85.4MB in the beginning and 76.9MB in the end (delta: 8.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1429.85ms. Allocated memory is still 111.1MB. Free memory was 76.2MB in the beginning and 64.5MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Witness Printer took 2.57ms. Allocated memory is still 111.1MB. Free memory was 64.5MB in the beginning and 64.0MB in the end (delta: 433.5kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 29]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 24, overapproximation of someBinaryArithmeticFLOAToperation at line 16. Possible FailurePath: [L1] int __return_main; VAL [__return_main=0] [L9] float main__tick = 0.10000000149011612; [L10] float main__time = 0.0; [L11] int main__i; [L12] main__i = 0 VAL [__return_main=0, main__i=0, main__tick=2500000037252903/25000000000000000, main__time=0] [L14] COND TRUE main__i < 10 [L16] main__time = main__time + main__tick [L17] main__i = main__i + 1 VAL [__return_main=0, main__i=1, main__tick=2500000037252903/25000000000000000] [L14] COND TRUE main__i < 10 [L16] main__time = main__time + main__tick [L17] main__i = main__i + 1 VAL [__return_main=0, main__i=2, main__tick=2500000037252903/25000000000000000] [L14] COND TRUE main__i < 10 [L16] main__time = main__time + main__tick [L17] main__i = main__i + 1 VAL [__return_main=0, main__i=3, main__tick=2500000037252903/25000000000000000] [L14] COND TRUE main__i < 10 [L16] main__time = main__time + main__tick [L17] main__i = main__i + 1 VAL [__return_main=0, main__i=4, main__tick=2500000037252903/25000000000000000] [L14] COND TRUE main__i < 10 [L16] main__time = main__time + main__tick [L17] main__i = main__i + 1 VAL [__return_main=0, main__i=5, main__tick=2500000037252903/25000000000000000] [L14] COND TRUE main__i < 10 [L16] main__time = main__time + main__tick [L17] main__i = main__i + 1 VAL [__return_main=0, main__i=6, main__tick=2500000037252903/25000000000000000] [L14] COND TRUE main__i < 10 [L16] main__time = main__time + main__tick [L17] main__i = main__i + 1 VAL [__return_main=0, main__i=7, main__tick=2500000037252903/25000000000000000] [L14] COND TRUE main__i < 10 [L16] main__time = main__time + main__tick [L17] main__i = main__i + 1 VAL [__return_main=0, main__i=8, main__tick=2500000037252903/25000000000000000] [L14] COND TRUE main__i < 10 [L16] main__time = main__time + main__tick [L17] main__i = main__i + 1 VAL [__return_main=0, main__i=9, main__tick=2500000037252903/25000000000000000] [L14] COND TRUE main__i < 10 [L16] main__time = main__time + main__tick [L17] main__i = main__i + 1 VAL [__return_main=0, main__i=10, main__tick=2500000037252903/25000000000000000] [L14] COND FALSE !(main__i < 10) [L23] int __tmp_1; [L24] __tmp_1 = main__time != 1.0 [L25] int __VERIFIER_assert__cond; [L26] __VERIFIER_assert__cond = __tmp_1 VAL [__return_main=0, __tmp_1=0, __VERIFIER_assert__cond=0, main__i=10, main__tick=2500000037252903/25000000000000000] [L27] COND TRUE __VERIFIER_assert__cond == 0 VAL [__return_main=0, __tmp_1=0, __VERIFIER_assert__cond=0, main__i=10, main__tick=2500000037252903/25000000000000000] [L29] reach_error() VAL [__return_main=0, __tmp_1=0, __VERIFIER_assert__cond=0, main__i=10, main__tick=2500000037252903/25000000000000000] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 9 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.4s, OverallIterations: 4, TraceHistogramMax: 10, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 42 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 24 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 27 IncrementalHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 18 mSDtfsCounter, 27 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 40 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16occurred in iteration=3, InterpolantAutomatonStates: 21, 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, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 50 NumberOfCodeBlocks, 50 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 43 ConstructedInterpolants, 0 QuantifiedInterpolants, 87 SizeOfPredicates, 0 NumberOfNonLiveVariables, 97 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 0/33 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-22 13:45:23,155 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/drift_tenth.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 ee159be1ed42c29b70080447b490f7a1aeb72331afc90e5794e0e8d61cb20d74 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-22 13:45:25,086 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 13:45:25,088 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 13:45:25,135 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 13:45:25,136 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 13:45:25,137 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 13:45:25,140 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 13:45:25,143 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 13:45:25,145 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 13:45:25,149 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 13:45:25,150 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 13:45:25,154 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 13:45:25,154 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 13:45:25,156 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 13:45:25,157 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 13:45:25,160 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 13:45:25,160 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 13:45:25,162 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 13:45:25,163 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 13:45:25,168 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 13:45:25,169 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 13:45:25,169 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 13:45:25,171 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 13:45:25,172 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 13:45:25,173 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 13:45:25,180 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 13:45:25,180 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 13:45:25,180 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 13:45:25,181 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 13:45:25,181 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 13:45:25,182 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 13:45:25,182 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 13:45:25,184 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 13:45:25,185 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 13:45:25,186 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 13:45:25,187 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 13:45:25,187 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 13:45:25,187 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 13:45:25,187 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 13:45:25,188 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 13:45:25,188 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 13:45:25,189 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 13:45:25,194 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-22 13:45:25,225 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 13:45:25,225 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 13:45:25,226 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 13:45:25,226 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 13:45:25,227 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 13:45:25,227 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 13:45:25,227 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 13:45:25,228 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 13:45:25,228 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 13:45:25,229 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 13:45:25,229 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 13:45:25,229 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 13:45:25,229 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 13:45:25,229 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 13:45:25,230 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 13:45:25,230 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 13:45:25,230 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-22 13:45:25,230 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-22 13:45:25,230 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-22 13:45:25,231 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 13:45:25,231 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 13:45:25,231 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 13:45:25,231 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 13:45:25,231 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 13:45:25,232 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 13:45:25,232 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 13:45:25,232 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 13:45:25,232 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 13:45:25,232 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 13:45:25,232 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 13:45:25,233 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-22 13:45:25,233 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-22 13:45:25,233 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 13:45:25,233 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 13:45:25,234 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 13:45:25,234 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-22 13:45:25,234 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 -> ee159be1ed42c29b70080447b490f7a1aeb72331afc90e5794e0e8d61cb20d74 [2022-07-22 13:45:25,522 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 13:45:25,543 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 13:45:25,545 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 13:45:25,546 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 13:45:25,547 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 13:45:25,548 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/drift_tenth.c.p+cfa-reducer.c [2022-07-22 13:45:25,612 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/275ae18ec/4cb6fbdc194546ecabc17d9acf0d67e4/FLAG7b97e7a65 [2022-07-22 13:45:25,975 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 13:45:25,976 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/drift_tenth.c.p+cfa-reducer.c [2022-07-22 13:45:25,981 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/275ae18ec/4cb6fbdc194546ecabc17d9acf0d67e4/FLAG7b97e7a65 [2022-07-22 13:45:26,000 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/275ae18ec/4cb6fbdc194546ecabc17d9acf0d67e4 [2022-07-22 13:45:26,003 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 13:45:26,004 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 13:45:26,006 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 13:45:26,007 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 13:45:26,009 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 13:45:26,010 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 01:45:26" (1/1) ... [2022-07-22 13:45:26,011 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60931673 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:45:26, skipping insertion in model container [2022-07-22 13:45:26,011 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 01:45:26" (1/1) ... [2022-07-22 13:45:26,017 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 13:45:26,032 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 13:45:26,175 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/drift_tenth.c.p+cfa-reducer.c[721,734] [2022-07-22 13:45:26,180 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 13:45:26,190 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 13:45:26,241 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/drift_tenth.c.p+cfa-reducer.c[721,734] [2022-07-22 13:45:26,242 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 13:45:26,253 INFO L208 MainTranslator]: Completed translation [2022-07-22 13:45:26,254 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:45:26 WrapperNode [2022-07-22 13:45:26,254 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 13:45:26,255 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 13:45:26,256 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 13:45:26,256 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 13:45:26,261 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:45:26" (1/1) ... [2022-07-22 13:45:26,267 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:45:26" (1/1) ... [2022-07-22 13:45:26,280 INFO L137 Inliner]: procedures = 13, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 31 [2022-07-22 13:45:26,280 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 13:45:26,282 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 13:45:26,282 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 13:45:26,282 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 13:45:26,288 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:45:26" (1/1) ... [2022-07-22 13:45:26,288 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:45:26" (1/1) ... [2022-07-22 13:45:26,299 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:45:26" (1/1) ... [2022-07-22 13:45:26,299 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:45:26" (1/1) ... [2022-07-22 13:45:26,310 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:45:26" (1/1) ... [2022-07-22 13:45:26,312 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:45:26" (1/1) ... [2022-07-22 13:45:26,317 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:45:26" (1/1) ... [2022-07-22 13:45:26,319 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 13:45:26,320 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 13:45:26,320 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 13:45:26,321 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 13:45:26,322 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:45:26" (1/1) ... [2022-07-22 13:45:26,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 13:45:26,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 13:45:26,356 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-22 13:45:26,371 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-22 13:45:26,398 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 13:45:26,398 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 13:45:26,398 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 13:45:26,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-22 13:45:26,468 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 13:45:26,469 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 13:45:26,687 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 13:45:26,692 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 13:45:26,692 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-22 13:45:26,693 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 01:45:26 BoogieIcfgContainer [2022-07-22 13:45:26,693 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 13:45:26,695 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 13:45:26,695 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 13:45:26,697 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 13:45:26,697 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 01:45:26" (1/3) ... [2022-07-22 13:45:26,711 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c7412a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 01:45:26, skipping insertion in model container [2022-07-22 13:45:26,711 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:45:26" (2/3) ... [2022-07-22 13:45:26,711 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c7412a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 01:45:26, skipping insertion in model container [2022-07-22 13:45:26,712 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 01:45:26" (3/3) ... [2022-07-22 13:45:26,713 INFO L111 eAbstractionObserver]: Analyzing ICFG drift_tenth.c.p+cfa-reducer.c [2022-07-22 13:45:26,723 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 13:45:26,723 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-22 13:45:26,798 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 13:45:26,804 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@20a4e3cd, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@67723dc2 [2022-07-22 13:45:26,804 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-22 13:45:26,808 INFO L276 IsEmpty]: Start isEmpty. Operand has 9 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 13:45:26,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-22 13:45:26,814 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 13:45:26,815 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-22 13:45:26,816 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 13:45:26,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 13:45:26,821 INFO L85 PathProgramCache]: Analyzing trace with hash 28696774, now seen corresponding path program 1 times [2022-07-22 13:45:26,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 13:45:26,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [299331285] [2022-07-22 13:45:26,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 13:45:26,833 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 13:45:26,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 13:45:26,835 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-22 13:45:26,837 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-22 13:45:26,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 13:45:26,939 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 13:45:26,942 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 13:45:26,995 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-22 13:45:26,995 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 13:45:26,996 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 13:45:26,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [299331285] [2022-07-22 13:45:26,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [299331285] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 13:45:26,997 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 13:45:26,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 13:45:26,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668210025] [2022-07-22 13:45:26,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 13:45:27,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 13:45:27,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 13:45:27,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 13:45:27,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 13:45:27,030 INFO L87 Difference]: Start difference. First operand has 9 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 13:45:27,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 13:45:27,170 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2022-07-22 13:45:27,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 13:45:27,177 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-07-22 13:45:27,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 13:45:27,183 INFO L225 Difference]: With dead ends: 16 [2022-07-22 13:45:27,183 INFO L226 Difference]: Without dead ends: 7 [2022-07-22 13:45:27,185 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-22 13:45:27,189 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 14 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.1s IncrementalHoareTripleChecker+Time [2022-07-22 13:45:27,190 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 14 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 13:45:27,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2022-07-22 13:45:27,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2022-07-22 13:45:27,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 13:45:27,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2022-07-22 13:45:27,218 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2022-07-22 13:45:27,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 13:45:27,218 INFO L495 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2022-07-22 13:45:27,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 13:45:27,219 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2022-07-22 13:45:27,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-22 13:45:27,220 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 13:45:27,220 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-22 13:45:27,239 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-22 13:45:27,433 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-22 13:45:27,433 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 13:45:27,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 13:45:27,434 INFO L85 PathProgramCache]: Analyzing trace with hash 889537510, now seen corresponding path program 1 times [2022-07-22 13:45:27,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 13:45:27,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [678999604] [2022-07-22 13:45:27,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 13:45:27,435 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 13:45:27,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 13:45:27,436 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-22 13:45:27,459 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-22 13:45:27,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 13:45:27,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-22 13:45:27,511 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 13:45:27,532 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-22 13:45:27,532 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 13:45:27,555 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-22 13:45:27,556 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 13:45:27,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [678999604] [2022-07-22 13:45:27,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [678999604] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 13:45:27,556 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 13:45:27,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-07-22 13:45:27,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590003665] [2022-07-22 13:45:27,557 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 13:45:27,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 13:45:27,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 13:45:27,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 13:45:27,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-22 13:45:27,559 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 13:45:27,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 13:45:27,731 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2022-07-22 13:45:27,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 13:45:27,734 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-07-22 13:45:27,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 13:45:27,735 INFO L225 Difference]: With dead ends: 13 [2022-07-22 13:45:27,735 INFO L226 Difference]: Without dead ends: 10 [2022-07-22 13:45:27,735 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2022-07-22 13:45:27,736 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 13:45:27,737 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 11 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 13:45:27,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2022-07-22 13:45:27,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2022-07-22 13:45:27,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 13:45:27,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2022-07-22 13:45:27,741 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 6 [2022-07-22 13:45:27,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 13:45:27,741 INFO L495 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2022-07-22 13:45:27,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 13:45:27,742 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2022-07-22 13:45:27,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-22 13:45:27,742 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 13:45:27,742 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1] [2022-07-22 13:45:27,759 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-22 13:45:27,959 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-22 13:45:27,960 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 13:45:27,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 13:45:27,960 INFO L85 PathProgramCache]: Analyzing trace with hash 201697478, now seen corresponding path program 2 times [2022-07-22 13:45:27,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 13:45:27,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [606919905] [2022-07-22 13:45:27,961 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 13:45:27,961 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 13:45:27,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 13:45:27,963 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-22 13:45:27,965 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-22 13:45:28,074 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 13:45:28,075 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 13:45:28,081 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-22 13:45:28,083 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 13:45:28,127 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 13:45:28,127 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 13:45:28,234 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 13:45:28,234 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 13:45:28,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [606919905] [2022-07-22 13:45:28,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [606919905] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 13:45:28,234 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 13:45:28,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-07-22 13:45:28,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763207952] [2022-07-22 13:45:28,235 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 13:45:28,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-22 13:45:28,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 13:45:28,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-22 13:45:28,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-07-22 13:45:28,236 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 13:45:28,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 13:45:28,788 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2022-07-22 13:45:28,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-22 13:45:28,791 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-07-22 13:45:28,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 13:45:28,792 INFO L225 Difference]: With dead ends: 19 [2022-07-22 13:45:28,792 INFO L226 Difference]: Without dead ends: 16 [2022-07-22 13:45:28,792 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2022-07-22 13:45:28,794 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-22 13:45:28,794 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 23 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-22 13:45:28,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-07-22 13:45:28,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-07-22 13:45:28,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 13:45:28,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2022-07-22 13:45:28,805 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 9 [2022-07-22 13:45:28,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 13:45:28,806 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2022-07-22 13:45:28,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 13:45:28,807 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-07-22 13:45:28,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-22 13:45:28,807 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 13:45:28,808 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1] [2022-07-22 13:45:28,823 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-22 13:45:29,021 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-22 13:45:29,021 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 13:45:29,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 13:45:29,022 INFO L85 PathProgramCache]: Analyzing trace with hash -763767610, now seen corresponding path program 3 times [2022-07-22 13:45:29,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 13:45:29,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1891661515] [2022-07-22 13:45:29,023 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-22 13:45:29,023 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 13:45:29,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 13:45:29,024 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-22 13:45:29,026 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-22 13:45:29,277 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-07-22 13:45:29,278 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 13:45:29,293 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-22 13:45:29,296 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 13:46:19,671 WARN L233 SmtUtils]: Spent 5.91s on a formula simplification that was a NOOP. DAG size: 22 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-22 13:46:47,966 WARN L233 SmtUtils]: Spent 5.71s on a formula simplification that was a NOOP. DAG size: 21 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-22 13:46:48,055 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 46 refuted. 9 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 13:46:48,056 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 13:47:09,682 WARN L855 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~main__time~0#1| |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from true [2022-07-22 13:47:15,593 WARN L855 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~main__time~0#1| |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from true [2022-07-22 13:47:21,928 WARN L855 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~main__time~0#1| |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from true [2022-07-22 13:47:28,165 WARN L855 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~main__time~0#1| |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from true [2022-07-22 13:48:02,369 WARN L855 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~main__time~0#1| |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from true [2022-07-22 13:48:10,493 WARN L855 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~main__time~0#1| |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from true [2022-07-22 13:48:16,643 WARN L833 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~main__time~0#1| |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from false [2022-07-22 13:48:18,692 WARN L855 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~main__time~0#1| |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from true [2022-07-22 13:48:24,821 WARN L833 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 2500000037252903.0 25000000000000000.0))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ +zero 11 53)) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0))) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from false [2022-07-22 13:48:26,862 WARN L855 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 2500000037252903.0 25000000000000000.0))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ +zero 11 53)) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0))) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from true [2022-07-22 13:48:26,863 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 3 refuted. 3 times theorem prover too weak. 0 trivial. 49 not checked. [2022-07-22 13:48:26,863 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 13:48:26,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1891661515] [2022-07-22 13:48:26,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1891661515] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 13:48:26,863 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 13:48:26,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 27 [2022-07-22 13:48:26,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616892035] [2022-07-22 13:48:26,864 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 13:48:26,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-07-22 13:48:26,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 13:48:26,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-07-22 13:48:26,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=279, Unknown=26, NotChecked=344, Total=756 [2022-07-22 13:48:26,865 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand has 28 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 27 states have internal predecessors, (29), 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-22 13:48:28,290 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 13:48:30,309 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 13:48:32,396 WARN L855 $PredicateComparison]: unable to prove that (and (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 2500000037252903.0 25000000000000000.0))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ +zero 11 53)) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0))) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-07-22 13:48:34,450 WARN L855 $PredicateComparison]: unable to prove that (and (= ((_ to_fp 8 24) c_currentRoundingMode (_ +zero 11 53)) |c_ULTIMATE.start_main_~main__time~0#1|) (= |c_ULTIMATE.start_main_~main__tick~0#1| ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 2500000037252903.0 25000000000000000.0)))) (= c_currentRoundingMode roundNearestTiesToEven) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~main__time~0#1| |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0)))) is different from true [2022-07-22 13:48:39,527 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-22 13:48:41,638 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~main__time~0#1| |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|)) .cse1)) (= |c_ULTIMATE.start_main_~main__tick~0#1| ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 2500000037252903.0 25000000000000000.0)))) (= (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ +zero 11 53)) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__time~0#1|) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2022-07-22 13:48:43,686 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~main__time~0#1| |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|)) .cse1)) (= |c_ULTIMATE.start_main_~main__tick~0#1| ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 2500000037252903.0 25000000000000000.0)))) (= (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ +zero 11 53)) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__time~0#1|) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-07-22 13:48:53,128 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-22 13:48:55,913 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~main__time~0#1| |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (= (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ +zero 11 53)) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__time~0#1|) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) (= |c_ULTIMATE.start_main_~main__tick~0#1| ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 2500000037252903.0 25000000000000000.0)))) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|)) .cse1)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-07-22 13:48:59,030 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~main__time~0#1| |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (= |c_ULTIMATE.start_main_~main__tick~0#1| ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 2500000037252903.0 25000000000000000.0)))) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) (= (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ +zero 11 53)) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__time~0#1|) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|)) .cse1)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-07-22 13:49:11,998 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result VALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-22 13:49:14,135 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~main__time~0#1| |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (= |c_ULTIMATE.start_main_~main__tick~0#1| ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 2500000037252903.0 25000000000000000.0)))) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|)) .cse1)) (= (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ +zero 11 53)) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__time~0#1|) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-07-22 13:49:16,184 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~main__time~0#1| |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (= (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ +zero 11 53)) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__time~0#1|) (= |c_ULTIMATE.start_main_~main__tick~0#1| ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 2500000037252903.0 25000000000000000.0)))) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~main__tick~0#1|)) .cse1)) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-07-22 13:49:37,629 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result VALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-22 13:49:41,583 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~main__time~0#1| |c_ULTIMATE.start_main_~main__tick~0#1|))) (let ((.cse3 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse2 |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|))) (let ((.cse0 (fp.add c_currentRoundingMode .cse3 |c_ULTIMATE.start_main_~main__tick~0#1|))) (let ((.cse4 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode .cse2) .cse1)) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode .cse3) .cse1)) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode .cse4) .cse1)) (= |c_ULTIMATE.start_main_~main__time~0#1| (let ((.cse5 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 2500000037252903.0 25000000000000000.0))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ +zero 11 53)) .cse5) .cse5) .cse5) .cse5) .cse5) .cse5) .cse5) .cse5) .cse5) .cse5))) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode .cse4 |c_ULTIMATE.start_main_~main__tick~0#1|)) .cse1)) (= c_currentRoundingMode roundNearestTiesToEven)))))) is different from true [2022-07-22 13:49:43,656 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~main__time~0#1| |c_ULTIMATE.start_main_~main__tick~0#1|))) (let ((.cse4 (fp.add c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~main__tick~0#1|))) (let ((.cse2 (fp.add c_currentRoundingMode .cse4 |c_ULTIMATE.start_main_~main__tick~0#1|))) (let ((.cse3 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse2 |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode .cse2) .cse1)) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode .cse3 |c_ULTIMATE.start_main_~main__tick~0#1|)) .cse1)) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode .cse3) .cse1)) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__time~0#1|) .cse1)) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode .cse4) .cse1))))))) is different from false [2022-07-22 13:49:45,709 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~main__time~0#1| |c_ULTIMATE.start_main_~main__tick~0#1|))) (let ((.cse4 (fp.add c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~main__tick~0#1|))) (let ((.cse2 (fp.add c_currentRoundingMode .cse4 |c_ULTIMATE.start_main_~main__tick~0#1|))) (let ((.cse3 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse2 |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode .cse2) .cse1)) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode .cse3 |c_ULTIMATE.start_main_~main__tick~0#1|)) .cse1)) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode .cse3) .cse1)) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__time~0#1|) .cse1)) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode .cse4) .cse1))))))) is different from true [2022-07-22 13:49:47,760 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~main__time~0#1| |c_ULTIMATE.start_main_~main__tick~0#1|))) (let ((.cse3 (fp.add c_currentRoundingMode .cse2 |c_ULTIMATE.start_main_~main__tick~0#1|))) (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse3 |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode .cse2) .cse1)) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~main__tick~0#1|)) .cse1)) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__time~0#1|) .cse1)) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode .cse3) .cse1)))))) is different from false [2022-07-22 13:49:49,815 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~main__time~0#1| |c_ULTIMATE.start_main_~main__tick~0#1|))) (let ((.cse3 (fp.add c_currentRoundingMode .cse2 |c_ULTIMATE.start_main_~main__tick~0#1|))) (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse3 |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode .cse2) .cse1)) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~main__tick~0#1|)) .cse1)) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__time~0#1|) .cse1)) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode .cse3) .cse1)))))) is different from true [2022-07-22 13:49:51,860 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~main__time~0#1| |c_ULTIMATE.start_main_~main__tick~0#1|))) (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse2 |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~main__tick~0#1|)) .cse1)) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode .cse2) .cse1)) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__time~0#1|) .cse1))))) is different from false [2022-07-22 13:49:53,900 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~main__time~0#1| |c_ULTIMATE.start_main_~main__tick~0#1|))) (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse2 |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~main__tick~0#1|)) .cse1)) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode .cse2) .cse1)) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__time~0#1|) .cse1))))) is different from true [2022-07-22 13:49:57,240 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~main__time~0#1| |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~main__tick~0#1|)) .cse1)) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__time~0#1|) .cse1)) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)))) is different from true