./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/double_req_bl_0682a.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/double_req_bl_0682a.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 77640868601be41246aa819b7e4e87995230298ea897561367d6e56014f366ff --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 02:54:16,036 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 02:54:16,038 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 02:54:16,107 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 02:54:16,108 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 02:54:16,109 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 02:54:16,112 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 02:54:16,114 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 02:54:16,116 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 02:54:16,121 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 02:54:16,122 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 02:54:16,124 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 02:54:16,125 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 02:54:16,127 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 02:54:16,128 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 02:54:16,131 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 02:54:16,132 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 02:54:16,133 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 02:54:16,135 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 02:54:16,140 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 02:54:16,142 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 02:54:16,143 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 02:54:16,143 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 02:54:16,144 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 02:54:16,146 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 02:54:16,152 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 02:54:16,153 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 02:54:16,153 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 02:54:16,154 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 02:54:16,154 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 02:54:16,155 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 02:54:16,156 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 02:54:16,158 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 02:54:16,159 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 02:54:16,159 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 02:54:16,160 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 02:54:16,160 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 02:54:16,161 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 02:54:16,161 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 02:54:16,161 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 02:54:16,162 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 02:54:16,163 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 02:54:16,165 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-12 02:54:16,193 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 02:54:16,194 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 02:54:16,194 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 02:54:16,195 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 02:54:16,195 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 02:54:16,196 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 02:54:16,196 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 02:54:16,196 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 02:54:16,196 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 02:54:16,197 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 02:54:16,198 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 02:54:16,198 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 02:54:16,198 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 02:54:16,198 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 02:54:16,198 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 02:54:16,198 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 02:54:16,199 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 02:54:16,199 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 02:54:16,199 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 02:54:16,200 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 02:54:16,200 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 02:54:16,201 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 02:54:16,201 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 02:54:16,201 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 02:54:16,201 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 02:54:16,201 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 02:54:16,201 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 02:54:16,202 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 02:54:16,202 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 02:54:16,202 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 02:54:16,202 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 02:54:16,202 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 02:54:16,203 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 02:54:16,203 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 -> 77640868601be41246aa819b7e4e87995230298ea897561367d6e56014f366ff [2022-07-12 02:54:16,471 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 02:54:16,493 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 02:54:16,495 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 02:54:16,496 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 02:54:16,496 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 02:54:16,497 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_0682a.c [2022-07-12 02:54:16,560 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbb9ae7e3/e754f424965b4083944eb2c3102919f1/FLAGd45c1bc71 [2022-07-12 02:54:17,054 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 02:54:17,067 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_0682a.c [2022-07-12 02:54:17,078 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbb9ae7e3/e754f424965b4083944eb2c3102919f1/FLAGd45c1bc71 [2022-07-12 02:54:17,413 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbb9ae7e3/e754f424965b4083944eb2c3102919f1 [2022-07-12 02:54:17,416 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 02:54:17,418 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 02:54:17,424 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 02:54:17,424 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 02:54:17,428 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 02:54:17,428 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 02:54:17" (1/1) ... [2022-07-12 02:54:17,429 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46f70c92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:54:17, skipping insertion in model container [2022-07-12 02:54:17,430 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 02:54:17" (1/1) ... [2022-07-12 02:54:17,438 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 02:54:17,480 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 02:54:17,697 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-newlib/double_req_bl_0682a.c[6875,6888] [2022-07-12 02:54:17,702 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 02:54:17,712 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 02:54:17,785 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-newlib/double_req_bl_0682a.c[6875,6888] [2022-07-12 02:54:17,786 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 02:54:17,806 INFO L208 MainTranslator]: Completed translation [2022-07-12 02:54:17,807 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:54:17 WrapperNode [2022-07-12 02:54:17,807 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 02:54:17,809 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 02:54:17,809 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 02:54:17,809 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 02:54:17,817 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:54:17" (1/1) ... [2022-07-12 02:54:17,842 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:54:17" (1/1) ... [2022-07-12 02:54:17,890 INFO L137 Inliner]: procedures = 21, calls = 98, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 313 [2022-07-12 02:54:17,891 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 02:54:17,891 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 02:54:17,892 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 02:54:17,892 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 02:54:17,900 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:54:17" (1/1) ... [2022-07-12 02:54:17,901 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:54:17" (1/1) ... [2022-07-12 02:54:17,920 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:54:17" (1/1) ... [2022-07-12 02:54:17,926 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:54:17" (1/1) ... [2022-07-12 02:54:17,951 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:54:17" (1/1) ... [2022-07-12 02:54:17,958 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:54:17" (1/1) ... [2022-07-12 02:54:17,965 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:54:17" (1/1) ... [2022-07-12 02:54:17,974 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 02:54:17,975 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 02:54:17,975 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 02:54:17,975 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 02:54:17,976 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:54:17" (1/1) ... [2022-07-12 02:54:17,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 02:54:17,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 02:54:18,017 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-12 02:54:18,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-12 02:54:18,073 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 02:54:18,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 02:54:18,074 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 02:54:18,074 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-07-12 02:54:18,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 02:54:18,074 INFO L130 BoogieDeclarations]: Found specification of procedure fabs_double [2022-07-12 02:54:18,075 INFO L138 BoogieDeclarations]: Found implementation of procedure fabs_double [2022-07-12 02:54:18,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-07-12 02:54:18,076 INFO L130 BoogieDeclarations]: Found specification of procedure atan_double [2022-07-12 02:54:18,076 INFO L138 BoogieDeclarations]: Found implementation of procedure atan_double [2022-07-12 02:54:18,076 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 02:54:18,076 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 02:54:18,076 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 02:54:18,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2022-07-12 02:54:18,077 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 02:54:18,222 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 02:54:18,224 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 02:54:18,801 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 02:54:18,808 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 02:54:18,809 INFO L299 CfgBuilder]: Removed 20 assume(true) statements. [2022-07-12 02:54:18,811 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 02:54:18 BoogieIcfgContainer [2022-07-12 02:54:18,811 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 02:54:18,813 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 02:54:18,813 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 02:54:18,816 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 02:54:18,817 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 02:54:17" (1/3) ... [2022-07-12 02:54:18,817 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ff669b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 02:54:18, skipping insertion in model container [2022-07-12 02:54:18,818 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:54:17" (2/3) ... [2022-07-12 02:54:18,818 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ff669b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 02:54:18, skipping insertion in model container [2022-07-12 02:54:18,818 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 02:54:18" (3/3) ... [2022-07-12 02:54:18,819 INFO L111 eAbstractionObserver]: Analyzing ICFG double_req_bl_0682a.c [2022-07-12 02:54:18,833 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 02:54:18,833 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 02:54:18,890 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 02:54:18,901 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@5069a4cc, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1cc69a [2022-07-12 02:54:18,902 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 02:54:18,910 INFO L276 IsEmpty]: Start isEmpty. Operand has 116 states, 108 states have (on average 1.7222222222222223) internal successors, (186), 109 states have internal predecessors, (186), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-12 02:54:18,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-12 02:54:18,919 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 02:54:18,920 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 02:54:18,920 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 02:54:18,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 02:54:18,924 INFO L85 PathProgramCache]: Analyzing trace with hash 334403016, now seen corresponding path program 1 times [2022-07-12 02:54:18,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 02:54:18,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149772419] [2022-07-12 02:54:18,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 02:54:18,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 02:54:19,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 02:54:19,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 02:54:19,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 02:54:19,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149772419] [2022-07-12 02:54:19,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149772419] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 02:54:19,146 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 02:54:19,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 02:54:19,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308659543] [2022-07-12 02:54:19,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 02:54:19,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-12 02:54:19,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 02:54:19,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-12 02:54:19,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 02:54:19,191 INFO L87 Difference]: Start difference. First operand has 116 states, 108 states have (on average 1.7222222222222223) internal successors, (186), 109 states have internal predecessors, (186), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:54:19,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 02:54:19,252 INFO L93 Difference]: Finished difference Result 230 states and 390 transitions. [2022-07-12 02:54:19,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-12 02:54:19,254 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 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 15 [2022-07-12 02:54:19,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 02:54:19,267 INFO L225 Difference]: With dead ends: 230 [2022-07-12 02:54:19,267 INFO L226 Difference]: Without dead ends: 112 [2022-07-12 02:54:19,272 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 02:54:19,278 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 02:54:19,279 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 02:54:19,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-07-12 02:54:19,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2022-07-12 02:54:19,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 105 states have (on average 1.4666666666666666) internal successors, (154), 105 states have internal predecessors, (154), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-12 02:54:19,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 162 transitions. [2022-07-12 02:54:19,343 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 162 transitions. Word has length 15 [2022-07-12 02:54:19,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 02:54:19,343 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 162 transitions. [2022-07-12 02:54:19,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:54:19,344 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 162 transitions. [2022-07-12 02:54:19,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-12 02:54:19,344 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 02:54:19,344 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 02:54:19,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 02:54:19,345 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 02:54:19,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 02:54:19,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1239810759, now seen corresponding path program 1 times [2022-07-12 02:54:19,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 02:54:19,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380912278] [2022-07-12 02:54:19,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 02:54:19,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 02:54:19,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 02:54:19,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 02:54:19,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 02:54:19,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380912278] [2022-07-12 02:54:19,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380912278] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 02:54:19,569 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 02:54:19,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 02:54:19,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673272071] [2022-07-12 02:54:19,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 02:54:19,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 02:54:19,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 02:54:19,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 02:54:19,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 02:54:19,574 INFO L87 Difference]: Start difference. First operand 112 states and 162 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:54:19,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 02:54:19,606 INFO L93 Difference]: Finished difference Result 213 states and 312 transitions. [2022-07-12 02:54:19,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 02:54:19,607 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-07-12 02:54:19,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 02:54:19,609 INFO L225 Difference]: With dead ends: 213 [2022-07-12 02:54:19,609 INFO L226 Difference]: Without dead ends: 112 [2022-07-12 02:54:19,610 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 02:54:19,611 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 0 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 02:54:19,612 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 318 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 02:54:19,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-07-12 02:54:19,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2022-07-12 02:54:19,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 105 states have (on average 1.457142857142857) internal successors, (153), 105 states have internal predecessors, (153), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-12 02:54:19,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 161 transitions. [2022-07-12 02:54:19,621 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 161 transitions. Word has length 18 [2022-07-12 02:54:19,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 02:54:19,621 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 161 transitions. [2022-07-12 02:54:19,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:54:19,622 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 161 transitions. [2022-07-12 02:54:19,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-12 02:54:19,622 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 02:54:19,623 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 02:54:19,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 02:54:19,623 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 02:54:19,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 02:54:19,624 INFO L85 PathProgramCache]: Analyzing trace with hash -386906492, now seen corresponding path program 1 times [2022-07-12 02:54:19,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 02:54:19,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737239385] [2022-07-12 02:54:19,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 02:54:19,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 02:54:20,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 02:54:20,139 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-12 02:54:20,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 02:54:20,593 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-12 02:54:20,594 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-12 02:54:20,595 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-12 02:54:20,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 02:54:20,600 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-07-12 02:54:20,604 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-12 02:54:20,670 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.07 02:54:20 BoogieIcfgContainer [2022-07-12 02:54:20,676 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-12 02:54:20,678 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-12 02:54:20,678 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-12 02:54:20,679 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-12 02:54:20,679 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 02:54:18" (3/4) ... [2022-07-12 02:54:20,682 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-12 02:54:20,682 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-12 02:54:20,683 INFO L158 Benchmark]: Toolchain (without parser) took 3265.06ms. Allocated memory was 96.5MB in the beginning and 151.0MB in the end (delta: 54.5MB). Free memory was 66.7MB in the beginning and 89.6MB in the end (delta: -22.9MB). Peak memory consumption was 31.6MB. Max. memory is 16.1GB. [2022-07-12 02:54:20,685 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 96.5MB. Free memory was 52.2MB in the beginning and 52.2MB in the end (delta: 46.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 02:54:20,688 INFO L158 Benchmark]: CACSL2BoogieTranslator took 384.29ms. Allocated memory was 96.5MB in the beginning and 125.8MB in the end (delta: 29.4MB). Free memory was 66.6MB in the beginning and 96.0MB in the end (delta: -29.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-12 02:54:20,693 INFO L158 Benchmark]: Boogie Procedure Inliner took 82.05ms. Allocated memory is still 125.8MB. Free memory was 96.0MB in the beginning and 91.0MB in the end (delta: 5.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-12 02:54:20,694 INFO L158 Benchmark]: Boogie Preprocessor took 82.73ms. Allocated memory is still 125.8MB. Free memory was 91.0MB in the beginning and 86.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-12 02:54:20,695 INFO L158 Benchmark]: RCFGBuilder took 836.42ms. Allocated memory is still 125.8MB. Free memory was 86.8MB in the beginning and 83.7MB in the end (delta: 3.1MB). Peak memory consumption was 28.2MB. Max. memory is 16.1GB. [2022-07-12 02:54:20,695 INFO L158 Benchmark]: TraceAbstraction took 1863.50ms. Allocated memory was 125.8MB in the beginning and 151.0MB in the end (delta: 25.2MB). Free memory was 83.4MB in the beginning and 89.6MB in the end (delta: -6.2MB). Peak memory consumption was 35.8MB. Max. memory is 16.1GB. [2022-07-12 02:54:20,696 INFO L158 Benchmark]: Witness Printer took 4.36ms. Allocated memory is still 151.0MB. Free memory is still 89.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 02:54:20,701 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.11ms. Allocated memory is still 96.5MB. Free memory was 52.2MB in the beginning and 52.2MB in the end (delta: 46.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 384.29ms. Allocated memory was 96.5MB in the beginning and 125.8MB in the end (delta: 29.4MB). Free memory was 66.6MB in the beginning and 96.0MB in the end (delta: -29.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 82.05ms. Allocated memory is still 125.8MB. Free memory was 96.0MB in the beginning and 91.0MB in the end (delta: 5.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 82.73ms. Allocated memory is still 125.8MB. Free memory was 91.0MB in the beginning and 86.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 836.42ms. Allocated memory is still 125.8MB. Free memory was 86.8MB in the beginning and 83.7MB in the end (delta: 3.1MB). Peak memory consumption was 28.2MB. Max. memory is 16.1GB. * TraceAbstraction took 1863.50ms. Allocated memory was 125.8MB in the beginning and 151.0MB in the end (delta: 25.2MB). Free memory was 83.4MB in the beginning and 89.6MB in the end (delta: -6.2MB). Peak memory consumption was 35.8MB. Max. memory is 16.1GB. * Witness Printer took 4.36ms. Allocated memory is still 151.0MB. Free memory is still 89.6MB. 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: 287]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 164, overapproximation of someUnaryDOUBLEoperation at line 54, overapproximation of someBinaryArithmeticDOUBLEoperation at line 165, overapproximation of bitwiseAnd at line 268, overapproximation of someBinaryDOUBLEComparisonOperation at line 286. Possible FailurePath: [L39-L44] static const double atanhi_atan[] = { 4.63647609000806093515e-01, 7.85398163397448278999e-01, 9.82793723247329054082e-01, 1.57079632679489655800e+00, }; [L46-L51] static const double atanlo_atan[] = { 2.26987774529616870924e-17, 3.06161699786838301793e-17, 1.39033110312309984516e-17, 6.12323399573676603587e-17, }; [L53-L60] static const double aT_atan[] = { 3.33333333333329318027e-01, -1.99999999998764832476e-01, 1.42857142725034663711e-01, -1.11111104054623557880e-01, 9.09088713343650656196e-02, -7.69187620504482999495e-02, 6.66107313738753120669e-02, -5.83357013379057348645e-02, 4.97687799461593236017e-02, -3.65315727442169155270e-02, 1.62858201153657823623e-02, }; [L62-L64] static const double one_atan = 1.0, pi_o_4 = 7.8539816339744827900E-01, pi_o_2 = 1.5707963267948965580E+00, pi = 3.1415926535897931160E+00, huge_atan = 1.0e300; [L141-L142] static const double tiny_atan2 = 1.0e-300, zero_atan2 = 0.0, pi_lo_atan2 = 1.2246467991473531772E-16; VAL [aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, zero_atan2=0] [L278] double x = -1.0 / 0.0; [L279] double y = __VERIFIER_nondet_double(); [L281] CALL, EXPR isinf_double(x) [L248] __int32_t hx, lx; VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001, zero_atan2=0] [L250] ieee_double_shape_type ew_u; [L251] ew_u.value = (x) [L252] EXPR ew_u.parts.msw [L252] (hx) = ew_u.parts.msw [L253] EXPR ew_u.parts.lsw [L253] (lx) = ew_u.parts.lsw [L255] hx &= 0x7fffffff [L256] hx |= (__uint32_t)(lx | (-lx)) >> 31 [L257] hx = 0x7ff00000 - hx [L258] return 1 - (int)((__uint32_t)(hx | (-hx)) >> 31); VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001, \result=1, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, hx=4293918720, lx=-1, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001, zero_atan2=0] [L281] RET, EXPR isinf_double(x) [L281] EXPR isinf_double(x) && isfinite_double(y) [L281] CALL, EXPR isfinite_double(y) [L262] __int32_t hx; VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003, zero_atan2=0] [L264] ieee_double_shape_type gh_u; [L265] gh_u.value = (x) [L266] EXPR gh_u.parts.msw [L266] (hx) = gh_u.parts.msw [L268] return (int)((__uint32_t)((hx & 0x7fffffff) - 0x7ff00000) >> 31); VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003, \result=1, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, hx=-3, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003, zero_atan2=0] [L281] RET, EXPR isfinite_double(y) [L281] EXPR isinf_double(x) && isfinite_double(y) VAL [aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, isfinite_double(y)=1, isinf_double(x)=1, isinf_double(x) && isfinite_double(y)=1, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001, y=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003, zero_atan2=0] [L281] COND TRUE isinf_double(x) && isfinite_double(y) && y < 0.0 [L283] CALL, EXPR __ieee754_atan2(y, x) [L145] double z; [L146] __int32_t k, m, hx, hy, ix, iy; [L147] __uint32_t lx, ly; VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001, \old(y)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001, y=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003, zero_atan2=0] [L150] ieee_double_shape_type ew_u; [L151] ew_u.value = (x) [L152] EXPR ew_u.parts.msw [L152] (hx) = ew_u.parts.msw [L153] EXPR ew_u.parts.lsw [L153] (lx) = ew_u.parts.lsw [L155] ix = hx & 0x7fffffff VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001, \old(y)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, hx=0, ix=0, lx=1, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001, y=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003, zero_atan2=0] [L157] ieee_double_shape_type ew_u; [L158] ew_u.value = (y) [L159] EXPR ew_u.parts.msw [L159] (hy) = ew_u.parts.msw [L160] EXPR ew_u.parts.lsw [L160] (ly) = ew_u.parts.lsw [L162] iy = hy & 0x7fffffff VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001, \old(y)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, hx=0, hy=0, ix=0, iy=0, lx=1, ly=0, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001, y=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003, zero_atan2=0] [L163-L164] COND TRUE ((ix | ((lx | -lx) >> 31)) > 0x7ff00000) || ((iy | ((ly | -ly) >> 31)) > 0x7ff00000) [L165] return x + y; VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001, \old(y)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, hx=0, hy=0, ix=0, iy=0, lx=1, ly=0, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001, y=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003, zero_atan2=0] [L283] RET, EXPR __ieee754_atan2(y, x) [L283] double res = __ieee754_atan2(y, x); [L286] COND TRUE res != -pi VAL [aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, res=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000004, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001, y=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003, zero_atan2=0] [L287] reach_error() VAL [aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, res=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000004, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001, y=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003, zero_atan2=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 116 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.7s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, 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, 485 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 156 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5 IncrementalHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 329 mSDtfsCounter, 5 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=116occurred in iteration=0, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 55 NumberOfCodeBlocks, 55 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 31 ConstructedInterpolants, 0 QuantifiedInterpolants, 32 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-07-12 02:54:20,751 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/double_req_bl_0682a.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 77640868601be41246aa819b7e4e87995230298ea897561367d6e56014f366ff --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 02:54:22,963 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 02:54:22,967 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 02:54:23,009 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 02:54:23,010 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 02:54:23,012 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 02:54:23,016 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 02:54:23,020 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 02:54:23,022 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 02:54:23,038 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 02:54:23,039 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 02:54:23,044 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 02:54:23,045 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 02:54:23,047 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 02:54:23,048 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 02:54:23,051 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 02:54:23,052 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 02:54:23,054 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 02:54:23,055 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 02:54:23,061 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 02:54:23,063 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 02:54:23,064 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 02:54:23,066 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 02:54:23,068 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 02:54:23,069 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 02:54:23,076 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 02:54:23,076 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 02:54:23,077 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 02:54:23,078 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 02:54:23,078 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 02:54:23,079 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 02:54:23,079 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 02:54:23,081 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 02:54:23,082 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 02:54:23,083 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 02:54:23,084 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 02:54:23,084 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 02:54:23,085 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 02:54:23,085 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 02:54:23,086 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 02:54:23,086 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 02:54:23,088 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 02:54:23,090 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-12 02:54:23,125 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 02:54:23,126 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 02:54:23,126 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 02:54:23,126 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 02:54:23,127 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 02:54:23,128 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 02:54:23,128 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 02:54:23,129 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 02:54:23,129 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 02:54:23,130 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 02:54:23,130 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 02:54:23,130 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 02:54:23,131 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 02:54:23,131 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 02:54:23,131 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 02:54:23,131 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 02:54:23,131 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-12 02:54:23,132 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-12 02:54:23,132 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-12 02:54:23,132 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 02:54:23,133 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 02:54:23,133 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 02:54:23,133 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 02:54:23,133 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 02:54:23,133 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 02:54:23,134 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 02:54:23,134 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 02:54:23,134 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 02:54:23,134 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 02:54:23,135 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 02:54:23,135 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-12 02:54:23,135 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-12 02:54:23,135 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 02:54:23,136 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 02:54:23,136 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 02:54:23,136 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-12 02:54:23,136 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 -> 77640868601be41246aa819b7e4e87995230298ea897561367d6e56014f366ff [2022-07-12 02:54:23,528 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 02:54:23,555 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 02:54:23,558 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 02:54:23,559 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 02:54:23,560 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 02:54:23,561 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_0682a.c [2022-07-12 02:54:23,635 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/059b7cade/27d367a93f28492a983d2bf350955f7e/FLAGfec2964ca [2022-07-12 02:54:24,205 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 02:54:24,206 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_0682a.c [2022-07-12 02:54:24,214 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/059b7cade/27d367a93f28492a983d2bf350955f7e/FLAGfec2964ca [2022-07-12 02:54:24,568 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/059b7cade/27d367a93f28492a983d2bf350955f7e [2022-07-12 02:54:24,571 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 02:54:24,572 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 02:54:24,574 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 02:54:24,574 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 02:54:24,577 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 02:54:24,578 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 02:54:24" (1/1) ... [2022-07-12 02:54:24,580 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@360cd75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:54:24, skipping insertion in model container [2022-07-12 02:54:24,580 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 02:54:24" (1/1) ... [2022-07-12 02:54:24,586 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 02:54:24,616 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 02:54:24,811 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-newlib/double_req_bl_0682a.c[6875,6888] [2022-07-12 02:54:24,814 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 02:54:24,829 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 02:54:24,927 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-newlib/double_req_bl_0682a.c[6875,6888] [2022-07-12 02:54:24,928 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 02:54:24,950 INFO L208 MainTranslator]: Completed translation [2022-07-12 02:54:24,951 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:54:24 WrapperNode [2022-07-12 02:54:24,951 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 02:54:24,952 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 02:54:24,952 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 02:54:24,952 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 02:54:24,960 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:54:24" (1/1) ... [2022-07-12 02:54:24,986 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:54:24" (1/1) ... [2022-07-12 02:54:25,014 INFO L137 Inliner]: procedures = 24, calls = 98, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 276 [2022-07-12 02:54:25,017 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 02:54:25,019 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 02:54:25,019 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 02:54:25,019 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 02:54:25,028 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:54:24" (1/1) ... [2022-07-12 02:54:25,028 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:54:24" (1/1) ... [2022-07-12 02:54:25,036 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:54:24" (1/1) ... [2022-07-12 02:54:25,037 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:54:24" (1/1) ... [2022-07-12 02:54:25,060 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:54:24" (1/1) ... [2022-07-12 02:54:25,067 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:54:24" (1/1) ... [2022-07-12 02:54:25,071 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:54:24" (1/1) ... [2022-07-12 02:54:25,076 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 02:54:25,078 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 02:54:25,078 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 02:54:25,078 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 02:54:25,079 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:54:24" (1/1) ... [2022-07-12 02:54:25,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 02:54:25,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 02:54:25,133 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-12 02:54:25,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-12 02:54:25,175 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 02:54:25,176 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2022-07-12 02:54:25,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2022-07-12 02:54:25,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-12 02:54:25,178 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 02:54:25,178 INFO L130 BoogieDeclarations]: Found specification of procedure fabs_double [2022-07-12 02:54:25,179 INFO L138 BoogieDeclarations]: Found implementation of procedure fabs_double [2022-07-12 02:54:25,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8 [2022-07-12 02:54:25,179 INFO L130 BoogieDeclarations]: Found specification of procedure atan_double [2022-07-12 02:54:25,179 INFO L138 BoogieDeclarations]: Found implementation of procedure atan_double [2022-07-12 02:54:25,179 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-12 02:54:25,185 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 02:54:25,185 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 02:54:25,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-12 02:54:25,185 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 02:54:25,321 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 02:54:25,331 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 02:54:48,127 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 02:54:48,134 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 02:54:48,135 INFO L299 CfgBuilder]: Removed 20 assume(true) statements. [2022-07-12 02:54:48,138 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 02:54:48 BoogieIcfgContainer [2022-07-12 02:54:48,139 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 02:54:48,141 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 02:54:48,142 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 02:54:48,145 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 02:54:48,145 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 02:54:24" (1/3) ... [2022-07-12 02:54:48,146 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b422101 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 02:54:48, skipping insertion in model container [2022-07-12 02:54:48,146 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:54:24" (2/3) ... [2022-07-12 02:54:48,146 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b422101 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 02:54:48, skipping insertion in model container [2022-07-12 02:54:48,146 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 02:54:48" (3/3) ... [2022-07-12 02:54:48,150 INFO L111 eAbstractionObserver]: Analyzing ICFG double_req_bl_0682a.c [2022-07-12 02:54:48,161 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 02:54:48,161 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 02:54:48,216 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 02:54:48,223 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@3550c2a2, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@60c84918 [2022-07-12 02:54:48,224 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 02:54:48,229 INFO L276 IsEmpty]: Start isEmpty. Operand has 103 states, 95 states have (on average 1.6526315789473685) internal successors, (157), 96 states have internal predecessors, (157), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-12 02:54:48,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-12 02:54:48,237 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 02:54:48,237 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 02:54:48,238 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 02:54:48,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 02:54:48,242 INFO L85 PathProgramCache]: Analyzing trace with hash -233161701, now seen corresponding path program 1 times [2022-07-12 02:54:48,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 02:54:48,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2062688394] [2022-07-12 02:54:48,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 02:54:48,262 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 02:54:48,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 02:54:48,266 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 02:54:48,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-12 02:54:48,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 02:54:48,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-12 02:54:48,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 02:54:48,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 02:54:48,801 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 02:54:48,802 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 02:54:48,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2062688394] [2022-07-12 02:54:48,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2062688394] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 02:54:48,803 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 02:54:48,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 02:54:48,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887735044] [2022-07-12 02:54:48,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 02:54:48,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-12 02:54:48,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 02:54:48,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-12 02:54:48,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 02:54:48,856 INFO L87 Difference]: Start difference. First operand has 103 states, 95 states have (on average 1.6526315789473685) internal successors, (157), 96 states have internal predecessors, (157), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:54:48,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 02:54:48,905 INFO L93 Difference]: Finished difference Result 204 states and 332 transitions. [2022-07-12 02:54:48,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-12 02:54:48,907 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 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 15 [2022-07-12 02:54:48,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 02:54:48,914 INFO L225 Difference]: With dead ends: 204 [2022-07-12 02:54:48,915 INFO L226 Difference]: Without dead ends: 99 [2022-07-12 02:54:48,918 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 02:54:48,922 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 02:54:48,923 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 02:54:48,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-07-12 02:54:48,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2022-07-12 02:54:48,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 92 states have (on average 1.423913043478261) internal successors, (131), 92 states have internal predecessors, (131), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-12 02:54:48,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 139 transitions. [2022-07-12 02:54:48,963 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 139 transitions. Word has length 15 [2022-07-12 02:54:48,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 02:54:48,964 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 139 transitions. [2022-07-12 02:54:48,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:54:48,965 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 139 transitions. [2022-07-12 02:54:48,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-12 02:54:48,966 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 02:54:48,966 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 02:54:48,995 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-12 02:54:49,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 02:54:49,182 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 02:54:49,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 02:54:49,182 INFO L85 PathProgramCache]: Analyzing trace with hash -114752879, now seen corresponding path program 1 times [2022-07-12 02:54:49,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 02:54:49,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [721875752] [2022-07-12 02:54:49,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 02:54:49,184 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 02:54:49,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 02:54:49,186 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 02:54:49,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-12 02:54:49,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 02:54:49,601 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-12 02:54:49,603 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 02:54:49,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 02:54:49,822 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 02:54:49,822 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 02:54:49,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [721875752] [2022-07-12 02:54:49,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [721875752] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 02:54:49,823 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 02:54:49,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 02:54:49,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114438030] [2022-07-12 02:54:49,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 02:54:49,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 02:54:49,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 02:54:49,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 02:54:49,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 02:54:49,826 INFO L87 Difference]: Start difference. First operand 99 states and 139 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:54:50,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 02:54:50,245 INFO L93 Difference]: Finished difference Result 187 states and 266 transitions. [2022-07-12 02:54:50,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 02:54:50,247 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-07-12 02:54:50,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 02:54:50,249 INFO L225 Difference]: With dead ends: 187 [2022-07-12 02:54:50,249 INFO L226 Difference]: Without dead ends: 99 [2022-07-12 02:54:50,250 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 02:54:50,252 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 0 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 02:54:50,252 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 272 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 02:54:50,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-07-12 02:54:50,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2022-07-12 02:54:50,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 92 states have (on average 1.4130434782608696) internal successors, (130), 92 states have internal predecessors, (130), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-12 02:54:50,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 138 transitions. [2022-07-12 02:54:50,264 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 138 transitions. Word has length 18 [2022-07-12 02:54:50,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 02:54:50,264 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 138 transitions. [2022-07-12 02:54:50,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:54:50,265 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 138 transitions. [2022-07-12 02:54:50,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-12 02:54:50,266 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 02:54:50,270 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 02:54:50,286 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-12 02:54:50,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 02:54:50,476 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 02:54:50,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 02:54:50,476 INFO L85 PathProgramCache]: Analyzing trace with hash -2086328612, now seen corresponding path program 1 times [2022-07-12 02:54:50,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 02:54:50,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [186965590] [2022-07-12 02:54:50,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 02:54:50,477 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 02:54:50,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 02:54:50,479 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 02:54:50,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-12 02:54:51,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 02:54:51,109 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 39 conjunts are in the unsatisfiable core [2022-07-12 02:54:51,114 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 02:54:51,789 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 16 [2022-07-12 02:54:55,342 INFO L356 Elim1Store]: treesize reduction 14, result has 44.0 percent of original size [2022-07-12 02:54:55,342 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 31 [2022-07-12 02:55:01,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 02:55:02,562 INFO L356 Elim1Store]: treesize reduction 14, result has 44.0 percent of original size [2022-07-12 02:55:02,563 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 42 [2022-07-12 02:55:06,341 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 02:55:06,342 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 17 [2022-07-12 02:55:13,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 02:55:13,576 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 02:55:13,577 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 02:55:13,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [186965590] [2022-07-12 02:55:13,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [186965590] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 02:55:13,577 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 02:55:13,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-12 02:55:13,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130025171] [2022-07-12 02:55:13,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 02:55:13,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-12 02:55:13,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 02:55:13,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-12 02:55:13,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=131, Unknown=1, NotChecked=0, Total=156 [2022-07-12 02:55:13,580 INFO L87 Difference]: Start difference. First operand 99 states and 138 transitions. Second operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 13 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:55:13,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 02:55:13,642 INFO L93 Difference]: Finished difference Result 103 states and 141 transitions. [2022-07-12 02:55:13,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 02:55:13,642 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 13 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-07-12 02:55:13,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 02:55:13,645 INFO L225 Difference]: With dead ends: 103 [2022-07-12 02:55:13,646 INFO L226 Difference]: Without dead ends: 99 [2022-07-12 02:55:13,646 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=24, Invalid=131, Unknown=1, NotChecked=0, Total=156 [2022-07-12 02:55:13,659 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 1 mSDsluCounter, 1246 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1373 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 152 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 02:55:13,659 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1373 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 152 Unchecked, 0.0s Time] [2022-07-12 02:55:13,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-07-12 02:55:13,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2022-07-12 02:55:13,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 92 states have (on average 1.4021739130434783) internal successors, (129), 92 states have internal predecessors, (129), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-12 02:55:13,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 137 transitions. [2022-07-12 02:55:13,671 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 137 transitions. Word has length 22 [2022-07-12 02:55:13,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 02:55:13,671 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 137 transitions. [2022-07-12 02:55:13,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 13 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:55:13,672 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 137 transitions. [2022-07-12 02:55:13,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-12 02:55:13,673 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 02:55:13,673 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 02:55:13,693 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-12 02:55:13,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 02:55:13,878 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 02:55:13,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 02:55:13,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1752843547, now seen corresponding path program 1 times [2022-07-12 02:55:13,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 02:55:13,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1789246334] [2022-07-12 02:55:13,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 02:55:13,879 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 02:55:13,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 02:55:13,881 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 02:55:13,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-12 02:55:14,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 02:55:14,245 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-12 02:55:14,247 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 02:55:17,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 02:55:17,730 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 02:55:17,730 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 02:55:17,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1789246334] [2022-07-12 02:55:17,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1789246334] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 02:55:17,731 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 02:55:17,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 02:55:17,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198107506] [2022-07-12 02:55:17,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 02:55:17,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 02:55:17,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 02:55:17,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 02:55:17,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 02:55:17,733 INFO L87 Difference]: Start difference. First operand 99 states and 137 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:55:18,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 02:55:18,596 INFO L93 Difference]: Finished difference Result 192 states and 273 transitions. [2022-07-12 02:55:18,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 02:55:18,597 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-07-12 02:55:18,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 02:55:18,599 INFO L225 Difference]: With dead ends: 192 [2022-07-12 02:55:18,599 INFO L226 Difference]: Without dead ends: 117 [2022-07-12 02:55:18,600 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 02:55:18,602 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 22 mSDsluCounter, 609 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 739 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 33 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-12 02:55:18,603 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 739 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 33 Unchecked, 0.8s Time] [2022-07-12 02:55:18,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-07-12 02:55:18,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 99. [2022-07-12 02:55:18,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 92 states have (on average 1.391304347826087) internal successors, (128), 92 states have internal predecessors, (128), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-12 02:55:18,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 136 transitions. [2022-07-12 02:55:18,619 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 136 transitions. Word has length 27 [2022-07-12 02:55:18,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 02:55:18,619 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 136 transitions. [2022-07-12 02:55:18,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:55:18,620 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 136 transitions. [2022-07-12 02:55:18,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-12 02:55:18,621 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 02:55:18,621 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 02:55:18,646 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-12 02:55:18,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 02:55:18,846 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 02:55:18,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 02:55:18,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1810101849, now seen corresponding path program 1 times [2022-07-12 02:55:18,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 02:55:18,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1708384915] [2022-07-12 02:55:18,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 02:55:18,847 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 02:55:18,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 02:55:18,849 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 02:55:18,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-12 02:55:19,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 02:55:19,226 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-12 02:55:19,230 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 02:55:24,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 02:55:24,341 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 02:55:24,341 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 02:55:24,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1708384915] [2022-07-12 02:55:24,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1708384915] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 02:55:24,341 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 02:55:24,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 02:55:24,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526150657] [2022-07-12 02:55:24,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 02:55:24,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 02:55:24,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 02:55:24,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 02:55:24,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-12 02:55:24,345 INFO L87 Difference]: Start difference. First operand 99 states and 136 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:55:24,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 02:55:24,873 INFO L93 Difference]: Finished difference Result 121 states and 166 transitions. [2022-07-12 02:55:24,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 02:55:24,876 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-07-12 02:55:24,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 02:55:24,877 INFO L225 Difference]: With dead ends: 121 [2022-07-12 02:55:24,880 INFO L226 Difference]: Without dead ends: 117 [2022-07-12 02:55:24,881 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-12 02:55:24,883 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 21 mSDsluCounter, 700 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 825 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 46 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 02:55:24,884 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 825 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 46 Unchecked, 0.5s Time] [2022-07-12 02:55:24,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-07-12 02:55:24,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 99. [2022-07-12 02:55:24,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 92 states have (on average 1.3804347826086956) internal successors, (127), 92 states have internal predecessors, (127), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-12 02:55:24,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 135 transitions. [2022-07-12 02:55:24,908 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 135 transitions. Word has length 27 [2022-07-12 02:55:24,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 02:55:24,909 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 135 transitions. [2022-07-12 02:55:24,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:55:24,910 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 135 transitions. [2022-07-12 02:55:24,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-12 02:55:24,913 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 02:55:24,913 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 02:55:24,935 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-12 02:55:25,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 02:55:25,128 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 02:55:25,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 02:55:25,128 INFO L85 PathProgramCache]: Analyzing trace with hash -144061543, now seen corresponding path program 1 times [2022-07-12 02:55:25,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 02:55:25,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1620682393] [2022-07-12 02:55:25,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 02:55:25,129 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 02:55:25,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 02:55:25,131 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 02:55:25,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-12 02:55:25,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 02:55:25,493 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-12 02:55:25,495 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 02:55:28,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 02:55:28,425 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 02:55:28,425 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 02:55:28,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1620682393] [2022-07-12 02:55:28,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1620682393] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 02:55:28,426 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 02:55:28,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 02:55:28,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412503478] [2022-07-12 02:55:28,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 02:55:28,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 02:55:28,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 02:55:28,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 02:55:28,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 02:55:28,427 INFO L87 Difference]: Start difference. First operand 99 states and 135 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:55:28,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 02:55:28,433 INFO L93 Difference]: Finished difference Result 107 states and 141 transitions. [2022-07-12 02:55:28,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 02:55:28,433 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-07-12 02:55:28,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 02:55:28,434 INFO L225 Difference]: With dead ends: 107 [2022-07-12 02:55:28,435 INFO L226 Difference]: Without dead ends: 101 [2022-07-12 02:55:28,435 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 02:55:28,436 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 14 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 13 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 02:55:28,436 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 594 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 13 Unchecked, 0.0s Time] [2022-07-12 02:55:28,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-07-12 02:55:28,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 97. [2022-07-12 02:55:28,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 90 states have (on average 1.3666666666666667) internal successors, (123), 90 states have internal predecessors, (123), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-12 02:55:28,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 131 transitions. [2022-07-12 02:55:28,444 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 131 transitions. Word has length 27 [2022-07-12 02:55:28,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 02:55:28,444 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 131 transitions. [2022-07-12 02:55:28,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:55:28,444 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 131 transitions. [2022-07-12 02:55:28,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-12 02:55:28,445 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 02:55:28,445 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 02:55:28,465 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-07-12 02:55:28,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 02:55:28,656 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 02:55:28,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 02:55:28,656 INFO L85 PathProgramCache]: Analyzing trace with hash 275809362, now seen corresponding path program 1 times [2022-07-12 02:55:28,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 02:55:28,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [177870764] [2022-07-12 02:55:28,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 02:55:28,657 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 02:55:28,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 02:55:28,658 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 02:55:28,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-12 02:55:29,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 02:55:29,068 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-12 02:55:29,071 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 02:55:30,643 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 16 [2022-07-12 02:55:31,981 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-07-12 02:55:42,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 02:55:42,851 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 02:55:42,852 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 02:55:42,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [177870764] [2022-07-12 02:55:42,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [177870764] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 02:55:42,852 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 02:55:42,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 02:55:42,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155619152] [2022-07-12 02:55:42,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 02:55:42,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 02:55:42,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 02:55:42,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 02:55:42,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=70, Unknown=1, NotChecked=0, Total=90 [2022-07-12 02:55:42,854 INFO L87 Difference]: Start difference. First operand 97 states and 131 transitions. Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:55:43,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 02:55:43,283 INFO L93 Difference]: Finished difference Result 101 states and 134 transitions. [2022-07-12 02:55:43,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 02:55:43,284 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 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 28 [2022-07-12 02:55:43,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 02:55:43,285 INFO L225 Difference]: With dead ends: 101 [2022-07-12 02:55:43,285 INFO L226 Difference]: Without dead ends: 97 [2022-07-12 02:55:43,285 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=19, Invalid=70, Unknown=1, NotChecked=0, Total=90 [2022-07-12 02:55:43,286 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 0 mSDsluCounter, 753 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 869 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 64 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 02:55:43,286 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 869 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 64 Unchecked, 0.4s Time] [2022-07-12 02:55:43,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-07-12 02:55:43,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2022-07-12 02:55:43,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 90 states have (on average 1.3555555555555556) internal successors, (122), 90 states have internal predecessors, (122), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-12 02:55:43,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 130 transitions. [2022-07-12 02:55:43,294 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 130 transitions. Word has length 28 [2022-07-12 02:55:43,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 02:55:43,294 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 130 transitions. [2022-07-12 02:55:43,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:55:43,295 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 130 transitions. [2022-07-12 02:55:43,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-12 02:55:43,296 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 02:55:43,296 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 02:55:43,322 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-07-12 02:55:43,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 02:55:43,516 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 02:55:43,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 02:55:43,516 INFO L85 PathProgramCache]: Analyzing trace with hash -489049033, now seen corresponding path program 1 times [2022-07-12 02:55:43,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 02:55:43,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [827626735] [2022-07-12 02:55:43,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 02:55:43,517 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 02:55:43,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 02:55:43,518 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 02:55:43,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-07-12 02:55:43,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 02:55:43,867 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-12 02:55:43,869 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 02:55:47,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 02:55:47,634 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 02:55:47,634 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 02:55:47,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [827626735] [2022-07-12 02:55:47,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [827626735] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 02:55:47,634 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 02:55:47,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 02:55:47,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024280963] [2022-07-12 02:55:47,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 02:55:47,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 02:55:47,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 02:55:47,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 02:55:47,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 02:55:47,635 INFO L87 Difference]: Start difference. First operand 97 states and 130 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:55:48,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 02:55:48,343 INFO L93 Difference]: Finished difference Result 118 states and 158 transitions. [2022-07-12 02:55:48,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 02:55:48,344 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 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 28 [2022-07-12 02:55:48,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 02:55:48,345 INFO L225 Difference]: With dead ends: 118 [2022-07-12 02:55:48,345 INFO L226 Difference]: Without dead ends: 114 [2022-07-12 02:55:48,346 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 02:55:48,347 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 14 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 708 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 26 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-12 02:55:48,347 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 708 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 26 Unchecked, 0.7s Time] [2022-07-12 02:55:48,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-07-12 02:55:48,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 101. [2022-07-12 02:55:48,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 94 states have (on average 1.3617021276595744) internal successors, (128), 94 states have internal predecessors, (128), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-12 02:55:48,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 136 transitions. [2022-07-12 02:55:48,355 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 136 transitions. Word has length 28 [2022-07-12 02:55:48,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 02:55:48,356 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 136 transitions. [2022-07-12 02:55:48,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:55:48,356 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 136 transitions. [2022-07-12 02:55:48,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-12 02:55:48,357 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 02:55:48,357 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 02:55:48,380 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-07-12 02:55:48,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 02:55:48,572 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 02:55:48,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 02:55:48,572 INFO L85 PathProgramCache]: Analyzing trace with hash -511928521, now seen corresponding path program 1 times [2022-07-12 02:55:48,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 02:55:48,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [22303429] [2022-07-12 02:55:48,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 02:55:48,573 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 02:55:48,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 02:55:48,575 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 02:55:48,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-07-12 02:55:48,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 02:55:49,004 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-12 02:55:49,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 02:55:52,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 02:55:52,660 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 02:55:52,661 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 02:55:52,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [22303429] [2022-07-12 02:55:52,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [22303429] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 02:55:52,661 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 02:55:52,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 02:55:52,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532877068] [2022-07-12 02:55:52,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 02:55:52,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 02:55:52,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 02:55:52,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 02:55:52,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 02:55:52,663 INFO L87 Difference]: Start difference. First operand 101 states and 136 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:55:53,907 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-12 02:55:55,502 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-12 02:55:56,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 02:55:56,015 INFO L93 Difference]: Finished difference Result 119 states and 159 transitions. [2022-07-12 02:55:56,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 02:55:56,027 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 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 28 [2022-07-12 02:55:56,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 02:55:56,028 INFO L225 Difference]: With dead ends: 119 [2022-07-12 02:55:56,028 INFO L226 Difference]: Without dead ends: 115 [2022-07-12 02:55:56,029 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 02:55:56,029 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 14 mSDsluCounter, 586 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 711 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 30 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-07-12 02:55:56,030 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 711 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 30 Unchecked, 3.3s Time] [2022-07-12 02:55:56,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-07-12 02:55:56,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 102. [2022-07-12 02:55:56,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 95 states have (on average 1.3578947368421053) internal successors, (129), 95 states have internal predecessors, (129), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-12 02:55:56,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 137 transitions. [2022-07-12 02:55:56,037 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 137 transitions. Word has length 28 [2022-07-12 02:55:56,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 02:55:56,037 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 137 transitions. [2022-07-12 02:55:56,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:55:56,038 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 137 transitions. [2022-07-12 02:55:56,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-12 02:55:56,038 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 02:55:56,039 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 02:55:56,060 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Ended with exit code 0 [2022-07-12 02:55:56,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 02:55:56,244 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 02:55:56,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 02:55:56,244 INFO L85 PathProgramCache]: Analyzing trace with hash -42468524, now seen corresponding path program 1 times [2022-07-12 02:55:56,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 02:55:56,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [97575431] [2022-07-12 02:55:56,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 02:55:56,245 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 02:55:56,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 02:55:56,247 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 02:55:56,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-07-12 02:55:56,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 02:55:56,632 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-12 02:55:56,634 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 02:56:03,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 02:56:03,503 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 02:56:03,503 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 02:56:03,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [97575431] [2022-07-12 02:56:03,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [97575431] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 02:56:03,503 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 02:56:03,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 02:56:03,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214795628] [2022-07-12 02:56:03,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 02:56:03,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 02:56:03,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 02:56:03,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 02:56:03,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 02:56:03,504 INFO L87 Difference]: Start difference. First operand 102 states and 137 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 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-12 02:56:13,396 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.61s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-12 02:56:15,408 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-12 02:56:17,689 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-12 02:56:20,703 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-12 02:56:27,838 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.68s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 02:56:30,426 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.59s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-12 02:56:32,828 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-12 02:56:35,122 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.29s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 02:56:39,267 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.65s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-12 02:56:41,271 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-12 02:56:44,376 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.76s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-12 02:56:47,288 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.91s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-12 02:56:50,189 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.90s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-12 02:56:53,171 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.98s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-12 02:56:53,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 02:56:53,538 INFO L93 Difference]: Finished difference Result 109 states and 144 transitions. [2022-07-12 02:56:53,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 02:56:53,540 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 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) Word has length 29 [2022-07-12 02:56:53,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 02:56:53,542 INFO L225 Difference]: With dead ends: 109 [2022-07-12 02:56:53,542 INFO L226 Difference]: Without dead ends: 105 [2022-07-12 02:56:53,542 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-12 02:56:53,543 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 97 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 1 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 43.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 45.9s IncrementalHoareTripleChecker+Time [2022-07-12 02:56:53,543 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 294 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 79 Invalid, 11 Unknown, 0 Unchecked, 45.9s Time] [2022-07-12 02:56:53,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-07-12 02:56:53,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 102. [2022-07-12 02:56:53,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 95 states have (on average 1.3368421052631578) internal successors, (127), 95 states have internal predecessors, (127), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-12 02:56:53,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 135 transitions. [2022-07-12 02:56:53,558 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 135 transitions. Word has length 29 [2022-07-12 02:56:53,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 02:56:53,558 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 135 transitions. [2022-07-12 02:56:53,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 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-12 02:56:53,559 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 135 transitions. [2022-07-12 02:56:53,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-12 02:56:53,564 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 02:56:53,564 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 02:56:53,584 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-07-12 02:56:53,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 02:56:53,766 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 02:56:53,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 02:56:53,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1779988844, now seen corresponding path program 1 times [2022-07-12 02:56:53,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 02:56:53,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [36227231] [2022-07-12 02:56:53,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 02:56:53,767 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 02:56:53,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 02:56:53,768 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 02:56:53,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-07-12 02:56:54,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 02:56:54,166 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-12 02:56:54,168 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 02:56:57,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 02:56:57,655 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 02:56:57,655 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 02:56:57,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [36227231] [2022-07-12 02:56:57,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [36227231] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 02:56:57,655 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 02:56:57,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 02:56:57,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204290265] [2022-07-12 02:56:57,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 02:56:57,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 02:56:57,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 02:56:57,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 02:56:57,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 02:56:57,657 INFO L87 Difference]: Start difference. First operand 102 states and 135 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 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-12 02:56:57,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 02:56:57,663 INFO L93 Difference]: Finished difference Result 161 states and 212 transitions. [2022-07-12 02:56:57,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 02:56:57,663 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 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) Word has length 29 [2022-07-12 02:56:57,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 02:56:57,664 INFO L225 Difference]: With dead ends: 161 [2022-07-12 02:56:57,664 INFO L226 Difference]: Without dead ends: 106 [2022-07-12 02:56:57,665 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 02:56:57,665 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 12 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 12 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 02:56:57,666 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 585 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 12 Unchecked, 0.0s Time] [2022-07-12 02:56:57,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-07-12 02:56:57,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 102. [2022-07-12 02:56:57,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 95 states have (on average 1.3157894736842106) internal successors, (125), 95 states have internal predecessors, (125), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-12 02:56:57,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 133 transitions. [2022-07-12 02:56:57,672 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 133 transitions. Word has length 29 [2022-07-12 02:56:57,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 02:56:57,673 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 133 transitions. [2022-07-12 02:56:57,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 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-12 02:56:57,673 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 133 transitions. [2022-07-12 02:56:57,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-12 02:56:57,674 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 02:56:57,674 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 02:56:57,695 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-07-12 02:56:57,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 02:56:57,888 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 02:56:57,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 02:56:57,888 INFO L85 PathProgramCache]: Analyzing trace with hash 2018423094, now seen corresponding path program 1 times [2022-07-12 02:56:57,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 02:56:57,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1962122063] [2022-07-12 02:56:57,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 02:56:57,889 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 02:56:57,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 02:56:57,890 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 02:56:57,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-07-12 02:56:58,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 02:56:58,230 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-12 02:56:58,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 02:57:03,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 02:57:03,997 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 02:57:03,998 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 02:57:03,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1962122063] [2022-07-12 02:57:03,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1962122063] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 02:57:03,998 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 02:57:03,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 02:57:03,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220850895] [2022-07-12 02:57:03,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 02:57:03,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 02:57:03,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 02:57:03,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 02:57:04,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-12 02:57:04,000 INFO L87 Difference]: Start difference. First operand 102 states and 133 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 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-12 02:57:04,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 02:57:04,721 INFO L93 Difference]: Finished difference Result 107 states and 138 transitions. [2022-07-12 02:57:04,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 02:57:04,722 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 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) Word has length 29 [2022-07-12 02:57:04,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 02:57:04,723 INFO L225 Difference]: With dead ends: 107 [2022-07-12 02:57:04,723 INFO L226 Difference]: Without dead ends: 103 [2022-07-12 02:57:04,723 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-12 02:57:04,724 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 0 mSDsluCounter, 652 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 769 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 42 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-12 02:57:04,724 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 769 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 42 Unchecked, 0.7s Time] [2022-07-12 02:57:04,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-07-12 02:57:04,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2022-07-12 02:57:04,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 96 states have (on average 1.3125) internal successors, (126), 96 states have internal predecessors, (126), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-12 02:57:04,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 134 transitions. [2022-07-12 02:57:04,730 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 134 transitions. Word has length 29 [2022-07-12 02:57:04,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 02:57:04,730 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 134 transitions. [2022-07-12 02:57:04,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 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-12 02:57:04,730 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 134 transitions. [2022-07-12 02:57:04,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-12 02:57:04,731 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 02:57:04,731 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 02:57:04,749 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-07-12 02:57:04,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 02:57:04,932 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 02:57:04,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 02:57:04,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1308443982, now seen corresponding path program 1 times [2022-07-12 02:57:04,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 02:57:04,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [319260871] [2022-07-12 02:57:04,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 02:57:04,933 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 02:57:04,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 02:57:04,935 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 02:57:04,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-07-12 02:57:05,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 02:57:05,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-12 02:57:05,325 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 02:57:11,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 02:57:11,100 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 02:57:11,101 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 02:57:11,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [319260871] [2022-07-12 02:57:11,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [319260871] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 02:57:11,101 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 02:57:11,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 02:57:11,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000282645] [2022-07-12 02:57:11,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 02:57:11,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 02:57:11,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 02:57:11,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 02:57:11,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-12 02:57:11,102 INFO L87 Difference]: Start difference. First operand 103 states and 134 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 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-12 02:57:13,217 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-12 02:57:15,272 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-12 02:57:16,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 02:57:16,326 INFO L93 Difference]: Finished difference Result 108 states and 139 transitions. [2022-07-12 02:57:16,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 02:57:16,338 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 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) Word has length 29 [2022-07-12 02:57:16,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 02:57:16,338 INFO L225 Difference]: With dead ends: 108 [2022-07-12 02:57:16,339 INFO L226 Difference]: Without dead ends: 104 [2022-07-12 02:57:16,339 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-12 02:57:16,339 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 0 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 26 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2022-07-12 02:57:16,340 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 666 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 1 Unknown, 26 Unchecked, 5.2s Time] [2022-07-12 02:57:16,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-07-12 02:57:16,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2022-07-12 02:57:16,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 97 states have (on average 1.309278350515464) internal successors, (127), 97 states have internal predecessors, (127), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-12 02:57:16,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 135 transitions. [2022-07-12 02:57:16,345 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 135 transitions. Word has length 29 [2022-07-12 02:57:16,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 02:57:16,345 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 135 transitions. [2022-07-12 02:57:16,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 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-12 02:57:16,345 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 135 transitions. [2022-07-12 02:57:16,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-12 02:57:16,346 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 02:57:16,346 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 02:57:16,367 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-07-12 02:57:16,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 02:57:16,553 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 02:57:16,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 02:57:16,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1854170638, now seen corresponding path program 1 times [2022-07-12 02:57:16,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 02:57:16,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [166489101] [2022-07-12 02:57:16,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 02:57:16,554 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 02:57:16,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 02:57:16,556 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 02:57:16,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-07-12 02:57:16,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 02:57:16,959 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-12 02:57:16,961 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 02:57:18,583 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 16 [2022-07-12 02:57:19,880 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-07-12 02:57:32,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 02:57:32,957 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 02:57:32,957 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 02:57:32,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [166489101] [2022-07-12 02:57:32,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [166489101] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 02:57:32,957 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 02:57:32,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 02:57:32,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68988270] [2022-07-12 02:57:32,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 02:57:32,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 02:57:32,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 02:57:32,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 02:57:32,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=70, Unknown=1, NotChecked=0, Total=90 [2022-07-12 02:57:32,959 INFO L87 Difference]: Start difference. First operand 104 states and 135 transitions. Second operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:57:33,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 02:57:33,004 INFO L93 Difference]: Finished difference Result 109 states and 140 transitions. [2022-07-12 02:57:33,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 02:57:33,005 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 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 30 [2022-07-12 02:57:33,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 02:57:33,007 INFO L225 Difference]: With dead ends: 109 [2022-07-12 02:57:33,007 INFO L226 Difference]: Without dead ends: 105 [2022-07-12 02:57:33,008 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=19, Invalid=70, Unknown=1, NotChecked=0, Total=90 [2022-07-12 02:57:33,008 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 0 mSDsluCounter, 821 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 933 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 77 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 02:57:33,009 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 933 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 77 Unchecked, 0.0s Time] [2022-07-12 02:57:33,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-07-12 02:57:33,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2022-07-12 02:57:33,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 98 states have (on average 1.3061224489795917) internal successors, (128), 98 states have internal predecessors, (128), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-12 02:57:33,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 136 transitions. [2022-07-12 02:57:33,016 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 136 transitions. Word has length 30 [2022-07-12 02:57:33,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 02:57:33,016 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 136 transitions. [2022-07-12 02:57:33,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:57:33,016 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 136 transitions. [2022-07-12 02:57:33,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-12 02:57:33,017 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 02:57:33,017 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 02:57:33,039 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-07-12 02:57:33,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 02:57:33,228 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 02:57:33,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 02:57:33,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1905565682, now seen corresponding path program 1 times [2022-07-12 02:57:33,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 02:57:33,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [734020476] [2022-07-12 02:57:33,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 02:57:33,229 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 02:57:33,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 02:57:33,230 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 02:57:33,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-07-12 02:57:33,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 02:57:33,714 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-12 02:57:33,716 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 02:57:51,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 02:57:51,656 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 02:57:51,656 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 02:57:51,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [734020476] [2022-07-12 02:57:51,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [734020476] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 02:57:51,656 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 02:57:51,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 02:57:51,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785013728] [2022-07-12 02:57:51,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 02:57:51,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 02:57:51,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 02:57:51,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 02:57:51,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=55, Unknown=2, NotChecked=0, Total=72 [2022-07-12 02:57:51,657 INFO L87 Difference]: Start difference. First operand 105 states and 136 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:57:53,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 02:57:53,060 INFO L93 Difference]: Finished difference Result 167 states and 218 transitions. [2022-07-12 02:57:53,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 02:57:53,061 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 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 30 [2022-07-12 02:57:53,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 02:57:53,062 INFO L225 Difference]: With dead ends: 167 [2022-07-12 02:57:53,062 INFO L226 Difference]: Without dead ends: 107 [2022-07-12 02:57:53,063 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.1s TimeCoverageRelationStatistics Valid=19, Invalid=69, Unknown=2, NotChecked=0, Total=90 [2022-07-12 02:57:53,063 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 7 mSDsluCounter, 807 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 927 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 32 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 02:57:53,063 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 927 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 32 Unchecked, 0.2s Time] [2022-07-12 02:57:53,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-07-12 02:57:53,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 103. [2022-07-12 02:57:53,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 96 states have (on average 1.3020833333333333) internal successors, (125), 96 states have internal predecessors, (125), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-12 02:57:53,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 133 transitions. [2022-07-12 02:57:53,075 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 133 transitions. Word has length 30 [2022-07-12 02:57:53,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 02:57:53,075 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 133 transitions. [2022-07-12 02:57:53,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:57:53,075 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 133 transitions. [2022-07-12 02:57:53,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-12 02:57:53,075 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 02:57:53,076 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 02:57:53,094 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-07-12 02:57:53,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 02:57:53,278 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 02:57:53,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 02:57:53,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1918665192, now seen corresponding path program 1 times [2022-07-12 02:57:53,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 02:57:53,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1238500882] [2022-07-12 02:57:53,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 02:57:53,280 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 02:57:53,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 02:57:53,282 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 02:57:53,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-07-12 02:57:53,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 02:57:53,762 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-12 02:57:53,764 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 02:57:56,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 02:57:56,376 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 02:57:56,376 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 02:57:56,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1238500882] [2022-07-12 02:57:56,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1238500882] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 02:57:56,376 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 02:57:56,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 02:57:56,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382333537] [2022-07-12 02:57:56,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 02:57:56,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 02:57:56,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 02:57:56,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 02:57:56,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 02:57:56,377 INFO L87 Difference]: Start difference. First operand 103 states and 133 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 02:57:56,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 02:57:56,381 INFO L93 Difference]: Finished difference Result 139 states and 178 transitions. [2022-07-12 02:57:56,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 02:57:56,381 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-07-12 02:57:56,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 02:57:56,382 INFO L225 Difference]: With dead ends: 139 [2022-07-12 02:57:56,382 INFO L226 Difference]: Without dead ends: 101 [2022-07-12 02:57:56,383 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 02:57:56,384 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 0 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 7 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 02:57:56,384 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 458 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 7 Unchecked, 0.0s Time] [2022-07-12 02:57:56,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-07-12 02:57:56,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2022-07-12 02:57:56,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 95 states have (on average 1.2947368421052632) internal successors, (123), 95 states have internal predecessors, (123), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 02:57:56,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 129 transitions. [2022-07-12 02:57:56,389 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 129 transitions. Word has length 35 [2022-07-12 02:57:56,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 02:57:56,389 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 129 transitions. [2022-07-12 02:57:56,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 02:57:56,390 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 129 transitions. [2022-07-12 02:57:56,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-12 02:57:56,390 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 02:57:56,390 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 02:57:56,407 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-07-12 02:57:56,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 02:57:56,591 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 02:57:56,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 02:57:56,592 INFO L85 PathProgramCache]: Analyzing trace with hash 469180040, now seen corresponding path program 1 times [2022-07-12 02:57:56,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 02:57:56,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [364988816] [2022-07-12 02:57:56,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 02:57:56,592 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 02:57:56,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 02:57:56,594 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 02:57:56,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-07-12 02:57:56,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 02:57:56,920 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-12 02:57:56,922 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 02:57:58,669 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 16 [2022-07-12 02:58:00,145 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-07-12 02:58:08,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 02:58:08,110 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 02:58:08,110 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 02:58:08,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [364988816] [2022-07-12 02:58:08,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [364988816] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 02:58:08,110 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 02:58:08,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 02:58:08,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666746991] [2022-07-12 02:58:08,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 02:58:08,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 02:58:08,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 02:58:08,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 02:58:08,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-12 02:58:08,111 INFO L87 Difference]: Start difference. First operand 101 states and 129 transitions. Second operand has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:58:08,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 02:58:08,125 INFO L93 Difference]: Finished difference Result 158 states and 205 transitions. [2022-07-12 02:58:08,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 02:58:08,126 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 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 34 [2022-07-12 02:58:08,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 02:58:08,128 INFO L225 Difference]: With dead ends: 158 [2022-07-12 02:58:08,128 INFO L226 Difference]: Without dead ends: 84 [2022-07-12 02:58:08,128 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-12 02:58:08,129 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 0 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 41 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 02:58:08,129 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 632 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 41 Unchecked, 0.0s Time] [2022-07-12 02:58:08,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-07-12 02:58:08,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2022-07-12 02:58:08,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 78 states have (on average 1.2435897435897436) internal successors, (97), 78 states have internal predecessors, (97), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 02:58:08,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 103 transitions. [2022-07-12 02:58:08,135 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 103 transitions. Word has length 34 [2022-07-12 02:58:08,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 02:58:08,135 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 103 transitions. [2022-07-12 02:58:08,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:58:08,136 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 103 transitions. [2022-07-12 02:58:08,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-12 02:58:08,136 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 02:58:08,136 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 02:58:08,156 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-07-12 02:58:08,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 02:58:08,352 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 02:58:08,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 02:58:08,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1116359772, now seen corresponding path program 1 times [2022-07-12 02:58:08,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 02:58:08,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1455615827] [2022-07-12 02:58:08,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 02:58:08,353 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 02:58:08,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 02:58:08,354 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 02:58:08,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-07-12 02:58:08,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 02:58:08,785 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-12 02:58:08,787 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 02:58:14,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 02:58:14,698 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 02:58:14,698 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 02:58:14,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1455615827] [2022-07-12 02:58:14,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1455615827] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 02:58:14,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 02:58:14,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 02:58:14,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263551906] [2022-07-12 02:58:14,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 02:58:14,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 02:58:14,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 02:58:14,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 02:58:14,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-12 02:58:14,700 INFO L87 Difference]: Start difference. First operand 84 states and 103 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:58:14,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 02:58:14,702 INFO L93 Difference]: Finished difference Result 84 states and 103 transitions. [2022-07-12 02:58:14,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 02:58:14,702 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 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 35 [2022-07-12 02:58:14,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 02:58:14,702 INFO L225 Difference]: With dead ends: 84 [2022-07-12 02:58:14,702 INFO L226 Difference]: Without dead ends: 0 [2022-07-12 02:58:14,702 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-12 02:58:14,703 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 8 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 02:58:14,703 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 99 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 8 Unchecked, 0.0s Time] [2022-07-12 02:58:14,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-12 02:58:14,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-12 02:58:14,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:58:14,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-12 02:58:14,704 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 35 [2022-07-12 02:58:14,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 02:58:14,704 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-12 02:58:14,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:58:14,705 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-12 02:58:14,705 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-12 02:58:14,707 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-12 02:58:14,725 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Ended with exit code 0 [2022-07-12 02:58:14,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 02:58:14,913 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-12 02:58:20,521 INFO L899 garLoopResultBuilder]: For program point L26(lines 26 31) no Hoare annotation was computed. [2022-07-12 02:58:20,521 INFO L899 garLoopResultBuilder]: For program point L26-1(lines 19 33) no Hoare annotation was computed. [2022-07-12 02:58:20,521 INFO L899 garLoopResultBuilder]: For program point fabs_doubleEXIT(lines 19 33) no Hoare annotation was computed. [2022-07-12 02:58:20,521 INFO L899 garLoopResultBuilder]: For program point L26-2(lines 26 31) no Hoare annotation was computed. [2022-07-12 02:58:20,522 INFO L902 garLoopResultBuilder]: At program point fabs_doubleENTRY(lines 19 33) the Hoare annotation is: true [2022-07-12 02:58:20,522 INFO L899 garLoopResultBuilder]: For program point L21-1(lines 21 25) no Hoare annotation was computed. [2022-07-12 02:58:20,522 INFO L902 garLoopResultBuilder]: At program point L21-2(lines 21 25) the Hoare annotation is: true [2022-07-12 02:58:20,522 INFO L899 garLoopResultBuilder]: For program point fabs_doubleFINAL(lines 19 33) no Hoare annotation was computed. [2022-07-12 02:58:20,522 INFO L902 garLoopResultBuilder]: At program point L97(line 97) the Hoare annotation is: true [2022-07-12 02:58:20,522 INFO L899 garLoopResultBuilder]: For program point L97-1(line 97) no Hoare annotation was computed. [2022-07-12 02:58:20,522 INFO L899 garLoopResultBuilder]: For program point L85(lines 85 88) no Hoare annotation was computed. [2022-07-12 02:58:20,522 INFO L899 garLoopResultBuilder]: For program point L98(lines 98 114) no Hoare annotation was computed. [2022-07-12 02:58:20,522 INFO L899 garLoopResultBuilder]: For program point L90(lines 90 115) no Hoare annotation was computed. [2022-07-12 02:58:20,522 INFO L899 garLoopResultBuilder]: For program point L78-1(lines 78 82) no Hoare annotation was computed. [2022-07-12 02:58:20,523 INFO L902 garLoopResultBuilder]: At program point L78-2(lines 78 82) the Hoare annotation is: true [2022-07-12 02:58:20,523 INFO L899 garLoopResultBuilder]: For program point L78-3(lines 76 89) no Hoare annotation was computed. [2022-07-12 02:58:20,523 INFO L899 garLoopResultBuilder]: For program point L107(lines 107 113) no Hoare annotation was computed. [2022-07-12 02:58:20,524 INFO L899 garLoopResultBuilder]: For program point L107-2(lines 90 115) no Hoare annotation was computed. [2022-07-12 02:58:20,524 INFO L899 garLoopResultBuilder]: For program point L70-1(lines 70 74) no Hoare annotation was computed. [2022-07-12 02:58:20,524 INFO L902 garLoopResultBuilder]: At program point L70-2(lines 70 74) the Hoare annotation is: true [2022-07-12 02:58:20,524 INFO L899 garLoopResultBuilder]: For program point L132(line 132) no Hoare annotation was computed. [2022-07-12 02:58:20,524 INFO L899 garLoopResultBuilder]: For program point L70-3(lines 70 74) no Hoare annotation was computed. [2022-07-12 02:58:20,524 INFO L899 garLoopResultBuilder]: For program point L99(lines 99 105) no Hoare annotation was computed. [2022-07-12 02:58:20,525 INFO L899 garLoopResultBuilder]: For program point L132-2(line 132) no Hoare annotation was computed. [2022-07-12 02:58:20,525 INFO L899 garLoopResultBuilder]: For program point L128(lines 128 133) no Hoare annotation was computed. [2022-07-12 02:58:20,525 INFO L899 garLoopResultBuilder]: For program point L91(lines 91 94) no Hoare annotation was computed. [2022-07-12 02:58:20,525 INFO L899 garLoopResultBuilder]: For program point L91-2(lines 91 94) no Hoare annotation was computed. [2022-07-12 02:58:20,525 INFO L899 garLoopResultBuilder]: For program point atan_doubleEXIT(lines 66 134) no Hoare annotation was computed. [2022-07-12 02:58:20,525 INFO L899 garLoopResultBuilder]: For program point L92(lines 92 93) no Hoare annotation was computed. [2022-07-12 02:58:20,525 INFO L902 garLoopResultBuilder]: At program point atan_doubleENTRY(lines 66 134) the Hoare annotation is: true [2022-07-12 02:58:20,526 INFO L899 garLoopResultBuilder]: For program point L76(lines 76 89) no Hoare annotation was computed. [2022-07-12 02:58:20,526 INFO L899 garLoopResultBuilder]: For program point atan_doubleFINAL(lines 66 134) no Hoare annotation was computed. [2022-07-12 02:58:20,526 INFO L899 garLoopResultBuilder]: For program point L217(lines 217 220) no Hoare annotation was computed. [2022-07-12 02:58:20,526 INFO L899 garLoopResultBuilder]: For program point L217-2(lines 215 220) no Hoare annotation was computed. [2022-07-12 02:58:20,526 INFO L899 garLoopResultBuilder]: For program point L201(line 201) no Hoare annotation was computed. [2022-07-12 02:58:20,526 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-12 02:58:20,526 INFO L899 garLoopResultBuilder]: For program point L185(lines 185 209) no Hoare annotation was computed. [2022-07-12 02:58:20,527 INFO L899 garLoopResultBuilder]: For program point L185-1(lines 144 244) no Hoare annotation was computed. [2022-07-12 02:58:20,527 INFO L895 garLoopResultBuilder]: At program point L268(lines 261 269) the Hoare annotation is: (and (= ((_ to_fp 11 53) currentRoundingMode (/ 1.0 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0)) ~tiny_atan2~0) (exists ((|v_skolemized_q#valueAsBitvector_34| (_ BitVec 64)) (|v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6| (_ BitVec 32))) (let ((.cse0 (select (select |#memory_int| |v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6|) (_ bv4 32)))) (and (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_34|) .cse0) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_34|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_34|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_34|)) |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_isfinite_double_#res#1| (bvlshr (bvadd (bvand (_ bv2147483647 32) .cse0) (_ bv2148532224 32)) (_ bv31 32)))))) (= ((_ to_fp 11 53) currentRoundingMode (/ 785398163397448279.0 250000000000000000.0)) ~pi~0) (= currentRoundingMode roundNearestTiesToEven) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53)) |ULTIMATE.start_main_~x~0#1|))) [2022-07-12 02:58:20,527 INFO L899 garLoopResultBuilder]: For program point L186(lines 186 208) no Hoare annotation was computed. [2022-07-12 02:58:20,527 INFO L899 garLoopResultBuilder]: For program point L203(line 203) no Hoare annotation was computed. [2022-07-12 02:58:20,527 INFO L899 garLoopResultBuilder]: For program point L170(lines 170 180) no Hoare annotation was computed. [2022-07-12 02:58:20,528 INFO L899 garLoopResultBuilder]: For program point L170-2(lines 144 244) no Hoare annotation was computed. [2022-07-12 02:58:20,528 INFO L899 garLoopResultBuilder]: For program point L286(lines 286 289) no Hoare annotation was computed. [2022-07-12 02:58:20,528 INFO L895 garLoopResultBuilder]: At program point L220(line 220) the Hoare annotation is: false [2022-07-12 02:58:20,528 INFO L899 garLoopResultBuilder]: For program point L187(lines 187 196) no Hoare annotation was computed. [2022-07-12 02:58:20,528 INFO L895 garLoopResultBuilder]: At program point L220-1(line 220) the Hoare annotation is: false [2022-07-12 02:58:20,528 INFO L899 garLoopResultBuilder]: For program point L220-2(line 220) no Hoare annotation was computed. [2022-07-12 02:58:20,528 INFO L899 garLoopResultBuilder]: For program point L171(lines 171 179) no Hoare annotation was computed. [2022-07-12 02:58:20,528 INFO L899 garLoopResultBuilder]: For program point L287(line 287) no Hoare annotation was computed. [2022-07-12 02:58:20,528 INFO L899 garLoopResultBuilder]: For program point L221(lines 221 243) no Hoare annotation was computed. [2022-07-12 02:58:20,528 INFO L899 garLoopResultBuilder]: For program point L188(line 188) no Hoare annotation was computed. [2022-07-12 02:58:20,528 INFO L899 garLoopResultBuilder]: For program point L205(line 205) no Hoare annotation was computed. [2022-07-12 02:58:20,529 INFO L899 garLoopResultBuilder]: For program point L172(line 172) no Hoare annotation was computed. [2022-07-12 02:58:20,529 INFO L899 garLoopResultBuilder]: For program point L172-2(line 172) no Hoare annotation was computed. [2022-07-12 02:58:20,529 INFO L899 garLoopResultBuilder]: For program point L222(line 222) no Hoare annotation was computed. [2022-07-12 02:58:20,529 INFO L899 garLoopResultBuilder]: For program point L156-1(lines 156 161) no Hoare annotation was computed. [2022-07-12 02:58:20,529 INFO L895 garLoopResultBuilder]: At program point L156-2(lines 156 161) the Hoare annotation is: (and (= ((_ to_fp 11 53) currentRoundingMode (/ 1.0 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0)) ~tiny_atan2~0) (fp.lt |ULTIMATE.start___ieee754_atan2_~y#1| (_ +zero 11 53)) (exists ((|v_skolemized_q#valueAsBitvector_34| (_ BitVec 64))) (and (= |ULTIMATE.start___ieee754_atan2_~y#1| (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_34|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_34|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_34|))) (not (= (bvlshr (bvadd (_ bv2148532224 32) (bvand ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_34|) (_ bv2147483647 32))) (_ bv31 32)) (_ bv0 32))))) (= ((_ to_fp 11 53) currentRoundingMode (/ 785398163397448279.0 250000000000000000.0)) ~pi~0) (exists ((|v_skolemized_q#valueAsBitvector_35| (_ BitVec 64)) (|v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7| (_ BitVec 32)) (currentRoundingMode RoundingMode)) (let ((.cse2 (select |#memory_int| |v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7|))) (let ((.cse0 (select .cse2 (_ bv4 32))) (.cse1 (select .cse2 (_ bv0 32)))) (and (= .cse0 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_35|)) (= |ULTIMATE.start___ieee754_atan2_~ix~1#1| (bvand .cse0 (_ bv2147483647 32))) (= |ULTIMATE.start___ieee754_atan2_~lx~0#1| .cse1) (= .cse1 ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_35|)) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_35|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_35|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_35|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53))))))) (exists ((|v_skolemized_q#valueAsBitvector_124| (_ BitVec 64)) (|v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_33| (_ BitVec 32)) (currentRoundingMode RoundingMode)) (let ((.cse3 (select (select |#memory_int| |v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_33|) (_ bv4 32)))) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_124|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_124|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_124|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53))) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_124|) .cse3) (= |ULTIMATE.start___ieee754_atan2_~hx~1#1| .cse3)))) (= currentRoundingMode roundNearestTiesToEven)) [2022-07-12 02:58:20,530 INFO L899 garLoopResultBuilder]: For program point L156-3(lines 156 161) no Hoare annotation was computed. [2022-07-12 02:58:20,530 INFO L899 garLoopResultBuilder]: For program point L239(line 239) no Hoare annotation was computed. [2022-07-12 02:58:20,530 INFO L899 garLoopResultBuilder]: For program point L173(line 173) no Hoare annotation was computed. [2022-07-12 02:58:20,530 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-12 02:58:20,531 INFO L899 garLoopResultBuilder]: For program point L190(line 190) no Hoare annotation was computed. [2022-07-12 02:58:20,531 INFO L899 garLoopResultBuilder]: For program point L224(line 224) no Hoare annotation was computed. [2022-07-12 02:58:20,531 INFO L899 garLoopResultBuilder]: For program point L241(line 241) no Hoare annotation was computed. [2022-07-12 02:58:20,531 INFO L899 garLoopResultBuilder]: For program point L175(line 175) no Hoare annotation was computed. [2022-07-12 02:58:20,531 INFO L895 garLoopResultBuilder]: At program point L258(lines 247 259) the Hoare annotation is: (and (= ((_ to_fp 11 53) currentRoundingMode (/ 1.0 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0)) ~tiny_atan2~0) (exists ((|v_skolemized_q#valueAsBitvector_33| (_ BitVec 64)) (|v_ULTIMATE.start_isinf_double_~#ew_u~2#1.base_7| (_ BitVec 32))) (and (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_33|) (select (select |#memory_int| |v_ULTIMATE.start_isinf_double_~#ew_u~2#1.base_7|) (_ bv4 32))) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_33|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_33|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_33|)) |ULTIMATE.start_main_~x~0#1|))) (= ((_ to_fp 11 53) currentRoundingMode (/ 785398163397448279.0 250000000000000000.0)) ~pi~0) (= currentRoundingMode roundNearestTiesToEven) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53)) |ULTIMATE.start_main_~x~0#1|))) [2022-07-12 02:58:20,531 INFO L899 garLoopResultBuilder]: For program point L192(line 192) no Hoare annotation was computed. [2022-07-12 02:58:20,531 INFO L902 garLoopResultBuilder]: At program point L292(lines 271 293) the Hoare annotation is: true [2022-07-12 02:58:20,531 INFO L899 garLoopResultBuilder]: For program point L226-1(lines 226 230) no Hoare annotation was computed. [2022-07-12 02:58:20,531 INFO L895 garLoopResultBuilder]: At program point L226-2(lines 226 230) the Hoare annotation is: false [2022-07-12 02:58:20,531 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-12 02:58:20,531 INFO L899 garLoopResultBuilder]: For program point L177(line 177) no Hoare annotation was computed. [2022-07-12 02:58:20,531 INFO L895 garLoopResultBuilder]: At program point L144(lines 144 244) the Hoare annotation is: (and (= ((_ to_fp 11 53) currentRoundingMode (/ 1.0 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0)) ~tiny_atan2~0) (= |ULTIMATE.start___ieee754_atan2_#res#1| (fp.sub roundNearestTiesToEven (fp.neg ~pi~0) ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0)))) (= ((_ to_fp 11 53) currentRoundingMode (/ 785398163397448279.0 250000000000000000.0)) ~pi~0) (= currentRoundingMode roundNearestTiesToEven)) [2022-07-12 02:58:20,532 INFO L899 garLoopResultBuilder]: For program point L194(line 194) no Hoare annotation was computed. [2022-07-12 02:58:20,532 INFO L899 garLoopResultBuilder]: For program point L212(line 212) no Hoare annotation was computed. [2022-07-12 02:58:20,532 INFO L899 garLoopResultBuilder]: For program point L212-2(line 212) no Hoare annotation was computed. [2022-07-12 02:58:20,532 INFO L899 garLoopResultBuilder]: For program point L163(lines 163 165) no Hoare annotation was computed. [2022-07-12 02:58:20,532 INFO L899 garLoopResultBuilder]: For program point L263-1(lines 263 267) no Hoare annotation was computed. [2022-07-12 02:58:20,532 INFO L895 garLoopResultBuilder]: At program point L263-2(lines 263 267) the Hoare annotation is: (and (= ((_ to_fp 11 53) currentRoundingMode (/ 1.0 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0)) ~tiny_atan2~0) (exists ((|v_skolemized_q#valueAsBitvector_33| (_ BitVec 64)) (|v_ULTIMATE.start_isinf_double_~#ew_u~2#1.base_7| (_ BitVec 32))) (and (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_33|) (select (select |#memory_int| |v_ULTIMATE.start_isinf_double_~#ew_u~2#1.base_7|) (_ bv4 32))) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_33|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_33|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_33|)) |ULTIMATE.start_main_~x~0#1|))) (= ((_ to_fp 11 53) currentRoundingMode (/ 785398163397448279.0 250000000000000000.0)) ~pi~0) (= |ULTIMATE.start_isfinite_double_~x#1| |ULTIMATE.start_main_~y~0#1|) (= currentRoundingMode roundNearestTiesToEven) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53)) |ULTIMATE.start_main_~x~0#1|))) [2022-07-12 02:58:20,532 INFO L899 garLoopResultBuilder]: For program point L263-3(lines 263 267) no Hoare annotation was computed. [2022-07-12 02:58:20,533 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-12 02:58:20,533 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 287) no Hoare annotation was computed. [2022-07-12 02:58:20,533 INFO L899 garLoopResultBuilder]: For program point L231(lines 231 236) no Hoare annotation was computed. [2022-07-12 02:58:20,533 INFO L899 garLoopResultBuilder]: For program point L198(lines 198 207) no Hoare annotation was computed. [2022-07-12 02:58:20,533 INFO L899 garLoopResultBuilder]: For program point L231-1(lines 224 237) no Hoare annotation was computed. [2022-07-12 02:58:20,533 INFO L899 garLoopResultBuilder]: For program point L231-2(lines 231 236) no Hoare annotation was computed. [2022-07-12 02:58:20,533 INFO L899 garLoopResultBuilder]: For program point L281(line 281) no Hoare annotation was computed. [2022-07-12 02:58:20,534 INFO L899 garLoopResultBuilder]: For program point L281-2(lines 281 290) no Hoare annotation was computed. [2022-07-12 02:58:20,534 INFO L899 garLoopResultBuilder]: For program point L215(lines 215 220) no Hoare annotation was computed. [2022-07-12 02:58:20,534 INFO L899 garLoopResultBuilder]: For program point L281-4(lines 281 290) no Hoare annotation was computed. [2022-07-12 02:58:20,534 INFO L899 garLoopResultBuilder]: For program point L149-1(lines 149 154) no Hoare annotation was computed. [2022-07-12 02:58:20,534 INFO L895 garLoopResultBuilder]: At program point L149-2(lines 149 154) the Hoare annotation is: (and (= ((_ to_fp 11 53) currentRoundingMode (/ 1.0 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0)) ~tiny_atan2~0) (fp.lt |ULTIMATE.start___ieee754_atan2_~y#1| (_ +zero 11 53)) (exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start___ieee754_atan2_~x#1| (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53)))) (exists ((|v_skolemized_q#valueAsBitvector_34| (_ BitVec 64)) (|v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6| (_ BitVec 32))) (let ((.cse0 (select (select |#memory_int| |v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6|) (_ bv4 32)))) (and (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_34|) .cse0) (= |ULTIMATE.start___ieee754_atan2_~y#1| (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_34|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_34|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_34|))) (not (= (bvlshr (bvadd (bvand (_ bv2147483647 32) .cse0) (_ bv2148532224 32)) (_ bv31 32)) (_ bv0 32)))))) (= ((_ to_fp 11 53) currentRoundingMode (/ 785398163397448279.0 250000000000000000.0)) ~pi~0) (= currentRoundingMode roundNearestTiesToEven)) [2022-07-12 02:58:20,534 INFO L899 garLoopResultBuilder]: For program point L149-3(lines 149 154) no Hoare annotation was computed. [2022-07-12 02:58:20,535 INFO L899 garLoopResultBuilder]: For program point L199(line 199) no Hoare annotation was computed. [2022-07-12 02:58:20,535 INFO L899 garLoopResultBuilder]: For program point L166(lines 166 167) no Hoare annotation was computed. [2022-07-12 02:58:20,535 INFO L899 garLoopResultBuilder]: For program point L249-1(lines 249 254) no Hoare annotation was computed. [2022-07-12 02:58:20,535 INFO L895 garLoopResultBuilder]: At program point L249-2(lines 249 254) the Hoare annotation is: (and (= ((_ to_fp 11 53) currentRoundingMode (/ 1.0 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0)) ~tiny_atan2~0) (= |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_isinf_double_~x#1|) (= ((_ to_fp 11 53) currentRoundingMode (/ 785398163397448279.0 250000000000000000.0)) ~pi~0) (= currentRoundingMode roundNearestTiesToEven) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53)) |ULTIMATE.start_main_~x~0#1|))) [2022-07-12 02:58:20,535 INFO L899 garLoopResultBuilder]: For program point L183(line 183) no Hoare annotation was computed. [2022-07-12 02:58:20,535 INFO L899 garLoopResultBuilder]: For program point L249-3(lines 249 254) no Hoare annotation was computed. [2022-07-12 02:58:20,535 INFO L899 garLoopResultBuilder]: For program point L183-2(line 183) no Hoare annotation was computed. [2022-07-12 02:58:20,535 INFO L895 garLoopResultBuilder]: At program point L167(line 167) the Hoare annotation is: false [2022-07-12 02:58:20,536 INFO L899 garLoopResultBuilder]: For program point L167-1(line 167) no Hoare annotation was computed. [2022-07-12 02:58:20,540 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 02:58:20,542 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-12 02:58:20,551 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:58:20,552 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:58:20,552 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-07-12 02:58:20,552 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6,QUANTIFIED] [2022-07-12 02:58:20,552 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-07-12 02:58:20,552 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-07-12 02:58:20,552 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-07-12 02:58:20,553 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6,QUANTIFIED] [2022-07-12 02:58:20,555 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 02:58:20,565 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:58:20,565 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:58:20,565 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-07-12 02:58:20,565 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6,QUANTIFIED] [2022-07-12 02:58:20,566 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-07-12 02:58:20,566 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-07-12 02:58:20,566 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-07-12 02:58:20,566 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6,QUANTIFIED] [2022-07-12 02:58:20,566 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 02:58:20,576 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2022-07-12 02:58:20,577 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~2#1.base_7,QUANTIFIED] [2022-07-12 02:58:20,577 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2022-07-12 02:58:20,577 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2022-07-12 02:58:20,577 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2022-07-12 02:58:20,577 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 02:58:20,578 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:58:20,578 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:58:20,578 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2022-07-12 02:58:20,579 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~2#1.base_7,QUANTIFIED] [2022-07-12 02:58:20,579 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2022-07-12 02:58:20,579 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2022-07-12 02:58:20,579 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2022-07-12 02:58:20,579 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 02:58:20,579 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:58:20,580 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:58:20,590 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-07-12 02:58:20,591 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-07-12 02:58:20,592 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-07-12 02:58:20,595 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-07-12 02:58:20,596 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7,QUANTIFIED] [2022-07-12 02:58:20,596 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-07-12 02:58:20,596 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7,QUANTIFIED] [2022-07-12 02:58:20,596 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7,QUANTIFIED] [2022-07-12 02:58:20,596 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7,QUANTIFIED] [2022-07-12 02:58:20,597 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-07-12 02:58:20,597 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-07-12 02:58:20,597 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-07-12 02:58:20,597 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-07-12 02:58:20,597 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:58:20,597 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:58:20,598 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_124,QUANTIFIED] [2022-07-12 02:58:20,598 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_124,QUANTIFIED] [2022-07-12 02:58:20,598 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_124,QUANTIFIED] [2022-07-12 02:58:20,598 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:58:20,598 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:58:20,598 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_124,QUANTIFIED] [2022-07-12 02:58:20,598 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_33,QUANTIFIED] [2022-07-12 02:58:20,599 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_33,QUANTIFIED] [2022-07-12 02:58:20,599 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 02:58:20,600 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-07-12 02:58:20,602 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-07-12 02:58:20,603 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-07-12 02:58:20,603 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-07-12 02:58:20,603 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7,QUANTIFIED] [2022-07-12 02:58:20,603 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-07-12 02:58:20,603 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7,QUANTIFIED] [2022-07-12 02:58:20,604 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7,QUANTIFIED] [2022-07-12 02:58:20,604 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7,QUANTIFIED] [2022-07-12 02:58:20,604 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-07-12 02:58:20,604 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-07-12 02:58:20,604 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-07-12 02:58:20,604 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-07-12 02:58:20,604 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:58:20,605 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:58:20,605 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_124,QUANTIFIED] [2022-07-12 02:58:20,605 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_124,QUANTIFIED] [2022-07-12 02:58:20,605 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_124,QUANTIFIED] [2022-07-12 02:58:20,605 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:58:20,606 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:58:20,606 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_124,QUANTIFIED] [2022-07-12 02:58:20,606 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_33,QUANTIFIED] [2022-07-12 02:58:20,606 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_33,QUANTIFIED] [2022-07-12 02:58:20,606 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 02:58:20,608 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-07-12 02:58:20,615 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6,QUANTIFIED] [2022-07-12 02:58:20,615 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-07-12 02:58:20,615 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-07-12 02:58:20,615 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-07-12 02:58:20,616 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6,QUANTIFIED] [2022-07-12 02:58:20,616 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 02:58:20,616 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:58:20,616 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:58:20,617 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-07-12 02:58:20,617 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6,QUANTIFIED] [2022-07-12 02:58:20,618 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-07-12 02:58:20,618 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-07-12 02:58:20,618 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-07-12 02:58:20,618 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6,QUANTIFIED] [2022-07-12 02:58:20,618 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 02:58:20,618 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:58:20,619 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:58:20,619 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2022-07-12 02:58:20,620 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~2#1.base_7,QUANTIFIED] [2022-07-12 02:58:20,620 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2022-07-12 02:58:20,620 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2022-07-12 02:58:20,620 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2022-07-12 02:58:20,621 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 02:58:20,621 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:58:20,621 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:58:20,621 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2022-07-12 02:58:20,622 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~2#1.base_7,QUANTIFIED] [2022-07-12 02:58:20,622 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2022-07-12 02:58:20,622 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2022-07-12 02:58:20,622 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2022-07-12 02:58:20,622 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 02:58:20,622 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:58:20,623 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:58:20,623 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 02:58:20,623 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 02:58:20,624 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 02:58:20,626 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 02:58:20,626 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 02:58:20,626 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 02:58:20,627 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 02:58:20,628 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:58:20,628 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:58:20,628 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 02:58:20,629 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:58:20,629 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:58:20,629 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.07 02:58:20 BoogieIcfgContainer [2022-07-12 02:58:20,631 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-12 02:58:20,632 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-12 02:58:20,632 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-12 02:58:20,632 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-12 02:58:20,633 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 02:54:48" (3/4) ... [2022-07-12 02:58:20,635 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-12 02:58:20,640 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fabs_double [2022-07-12 02:58:20,640 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure atan_double [2022-07-12 02:58:20,654 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 37 nodes and edges [2022-07-12 02:58:20,654 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2022-07-12 02:58:20,655 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-07-12 02:58:20,655 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-12 02:58:20,680 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) == tiny_atan2 && x == x) && ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 785398163397448279/250000000000000000) == pi) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) && (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE()) == x) [2022-07-12 02:58:20,681 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) == tiny_atan2 && (\exists v_skolemized_q#valueAsBitvector_33 : bv64, v_ULTIMATE.start_isinf_double_~#ew_u~2#1.base_7 : bv32 :: v_skolemized_q#valueAsBitvector_33[63:32] == unknown-#memory_int-unknown[v_ULTIMATE.start_isinf_double_~#ew_u~2#1.base_7][4bv32] && ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_33[63:63], v_skolemized_q#valueAsBitvector_33[62:52], v_skolemized_q#valueAsBitvector_33[51:0]) == x)) && ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 785398163397448279/250000000000000000) == pi) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) && (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE()) == x) [2022-07-12 02:58:20,681 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) == tiny_atan2 && (\exists v_skolemized_q#valueAsBitvector_33 : bv64, v_ULTIMATE.start_isinf_double_~#ew_u~2#1.base_7 : bv32 :: v_skolemized_q#valueAsBitvector_33[63:32] == unknown-#memory_int-unknown[v_ULTIMATE.start_isinf_double_~#ew_u~2#1.base_7][4bv32] && ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_33[63:63], v_skolemized_q#valueAsBitvector_33[62:52], v_skolemized_q#valueAsBitvector_33[51:0]) == x)) && ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 785398163397448279/250000000000000000) == pi) && x == y) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) && (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE()) == x) [2022-07-12 02:58:20,682 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) == tiny_atan2 && (\exists v_skolemized_q#valueAsBitvector_34 : bv64, v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6 : bv32 :: (v_skolemized_q#valueAsBitvector_34[63:32] == unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6][4bv32] && ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_34[63:63], v_skolemized_q#valueAsBitvector_34[62:52], v_skolemized_q#valueAsBitvector_34[51:0]) == y) && \result == ~bvlshr32(~bvadd64(~bvand32(2147483647bv32, unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6][4bv32]), 2148532224bv32), 31bv32))) && ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 785398163397448279/250000000000000000) == pi) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) && (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE()) == x) [2022-07-12 02:58:20,682 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) == tiny_atan2 && ~fp.lt~DOUBLE(y, ~Pluszero~LONGDOUBLE())) && (\exists currentRoundingMode : FloatRoundingMode :: x == ~fp.div~DOUBLE(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE()))) && (\exists v_skolemized_q#valueAsBitvector_34 : bv64, v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6 : bv32 :: (v_skolemized_q#valueAsBitvector_34[63:32] == unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6][4bv32] && y == ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_34[63:63], v_skolemized_q#valueAsBitvector_34[62:52], v_skolemized_q#valueAsBitvector_34[51:0])) && !(~bvlshr32(~bvadd64(~bvand32(2147483647bv32, unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6][4bv32]), 2148532224bv32), 31bv32) == 0bv32))) && ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 785398163397448279/250000000000000000) == pi) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven [2022-07-12 02:58:20,683 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) == tiny_atan2 && ~fp.lt~DOUBLE(y, ~Pluszero~LONGDOUBLE())) && (\exists v_skolemized_q#valueAsBitvector_34 : bv64 :: y == ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_34[63:63], v_skolemized_q#valueAsBitvector_34[62:52], v_skolemized_q#valueAsBitvector_34[51:0]) && !(~bvlshr32(~bvadd64(2148532224bv32, ~bvand32(v_skolemized_q#valueAsBitvector_34[63:32], 2147483647bv32)), 31bv32) == 0bv32))) && ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 785398163397448279/250000000000000000) == pi) && (\exists v_skolemized_q#valueAsBitvector_35 : bv64, v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7 : bv32, currentRoundingMode : FloatRoundingMode :: (((unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7][4bv32] == v_skolemized_q#valueAsBitvector_35[63:32] && ix == ~bvand32(unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7][4bv32], 2147483647bv32)) && lx == unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7][0bv32]) && unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7][0bv32] == v_skolemized_q#valueAsBitvector_35[31:0]) && ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_35[63:63], v_skolemized_q#valueAsBitvector_35[62:52], v_skolemized_q#valueAsBitvector_35[51:0]) == ~fp.div~DOUBLE(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE()))) && (\exists v_skolemized_q#valueAsBitvector_124 : bv64, v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_33 : bv32, currentRoundingMode : FloatRoundingMode :: (~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_124[63:63], v_skolemized_q#valueAsBitvector_124[62:52], v_skolemized_q#valueAsBitvector_124[51:0]) == ~fp.div~DOUBLE(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE()) && v_skolemized_q#valueAsBitvector_124[63:32] == unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_33][4bv32]) && hx == unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_33][4bv32])) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven [2022-07-12 02:58:20,683 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) == tiny_atan2 && \result == ~fp.sub~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(pi), ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000))) && ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 785398163397448279/250000000000000000) == pi) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven [2022-07-12 02:58:20,729 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-12 02:58:20,729 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-12 02:58:20,730 INFO L158 Benchmark]: Toolchain (without parser) took 236157.36ms. Allocated memory was 50.3MB in the beginning and 65.0MB in the end (delta: 14.7MB). Free memory was 26.4MB in the beginning and 37.5MB in the end (delta: -11.2MB). Peak memory consumption was 22.0MB. Max. memory is 16.1GB. [2022-07-12 02:58:20,730 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 50.3MB. Free memory was 31.2MB in the beginning and 31.2MB in the end (delta: 46.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 02:58:20,733 INFO L158 Benchmark]: CACSL2BoogieTranslator took 377.45ms. Allocated memory was 50.3MB in the beginning and 65.0MB in the end (delta: 14.7MB). Free memory was 26.2MB in the beginning and 42.0MB in the end (delta: -15.8MB). Peak memory consumption was 5.2MB. Max. memory is 16.1GB. [2022-07-12 02:58:20,737 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.75ms. Allocated memory is still 65.0MB. Free memory was 42.0MB in the beginning and 39.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 02:58:20,737 INFO L158 Benchmark]: Boogie Preprocessor took 58.12ms. Allocated memory is still 65.0MB. Free memory was 39.5MB in the beginning and 36.5MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-12 02:58:20,737 INFO L158 Benchmark]: RCFGBuilder took 23061.32ms. Allocated memory is still 65.0MB. Free memory was 36.5MB in the beginning and 38.9MB in the end (delta: -2.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-07-12 02:58:20,738 INFO L158 Benchmark]: TraceAbstraction took 212489.82ms. Allocated memory is still 65.0MB. Free memory was 38.4MB in the beginning and 21.5MB in the end (delta: 16.9MB). Peak memory consumption was 19.3MB. Max. memory is 16.1GB. [2022-07-12 02:58:20,738 INFO L158 Benchmark]: Witness Printer took 97.62ms. Allocated memory is still 65.0MB. Free memory was 21.1MB in the beginning and 37.5MB in the end (delta: -16.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 02:58:20,744 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.23ms. Allocated memory is still 50.3MB. Free memory was 31.2MB in the beginning and 31.2MB in the end (delta: 46.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 377.45ms. Allocated memory was 50.3MB in the beginning and 65.0MB in the end (delta: 14.7MB). Free memory was 26.2MB in the beginning and 42.0MB in the end (delta: -15.8MB). Peak memory consumption was 5.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.75ms. Allocated memory is still 65.0MB. Free memory was 42.0MB in the beginning and 39.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.12ms. Allocated memory is still 65.0MB. Free memory was 39.5MB in the beginning and 36.5MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 23061.32ms. Allocated memory is still 65.0MB. Free memory was 36.5MB in the beginning and 38.9MB in the end (delta: -2.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 212489.82ms. Allocated memory is still 65.0MB. Free memory was 38.4MB in the beginning and 21.5MB in the end (delta: 16.9MB). Peak memory consumption was 19.3MB. Max. memory is 16.1GB. * Witness Printer took 97.62ms. Allocated memory is still 65.0MB. Free memory was 21.1MB in the beginning and 37.5MB in the end (delta: -16.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~2#1.base_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~2#1.base_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_124,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_124,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_124,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_124,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_33,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_33,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_124,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_124,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_124,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_124,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_33,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_33,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~2#1.base_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~2#1.base_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] * 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 - PositiveResult [Line: 287]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 103 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 212.3s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 64.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 5.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 12 mSolverCounterUnknown, 215 SdHoareTripleChecker+Valid, 58.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 202 mSDsluCounter, 11598 SdHoareTripleChecker+Invalid, 55.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 609 IncrementalHoareTripleChecker+Unchecked, 9512 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 138 IncrementalHoareTripleChecker+Invalid, 767 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 2086 mSDtfsCounter, 138 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 485 GetRequests, 383 SyntacticMatches, 3 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 73.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=105occurred in iteration=14, InterpolantAutomatonStates: 132, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 18 MinimizatonAttempts, 77 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 18 LocationsWithAnnotation, 82 PreInvPairs, 90 NumberOfFragments, 386 HoareAnnotationTreeSize, 82 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 18 FomulaSimplificationsInter, 343 FormulaSimplificationTreeSizeReductionInter, 5.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 5.6s SatisfiabilityAnalysisTime, 131.6s InterpolantComputationTime, 500 NumberOfCodeBlocks, 500 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 482 ConstructedInterpolants, 316 QuantifiedInterpolants, 7416 SizeOfPredicates, 156 NumberOfNonLiveVariables, 3307 ConjunctsInSsa, 248 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 149]: Loop Invariant [2022-07-12 02:58:20,770 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:58:20,771 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:58:20,771 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-07-12 02:58:20,771 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6,QUANTIFIED] [2022-07-12 02:58:20,771 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-07-12 02:58:20,771 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-07-12 02:58:20,771 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-07-12 02:58:20,771 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6,QUANTIFIED] [2022-07-12 02:58:20,772 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 02:58:20,772 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:58:20,773 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:58:20,773 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-07-12 02:58:20,773 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6,QUANTIFIED] [2022-07-12 02:58:20,773 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-07-12 02:58:20,773 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-07-12 02:58:20,773 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-07-12 02:58:20,773 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6,QUANTIFIED] [2022-07-12 02:58:20,774 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ((((~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) == tiny_atan2 && ~fp.lt~DOUBLE(y, ~Pluszero~LONGDOUBLE())) && (\exists currentRoundingMode : FloatRoundingMode :: x == ~fp.div~DOUBLE(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE()))) && (\exists v_skolemized_q#valueAsBitvector_34 : bv64, v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6 : bv32 :: (v_skolemized_q#valueAsBitvector_34[63:32] == unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6][4bv32] && y == ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_34[63:63], v_skolemized_q#valueAsBitvector_34[62:52], v_skolemized_q#valueAsBitvector_34[51:0])) && !(~bvlshr32(~bvadd64(~bvand32(2147483647bv32, unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6][4bv32]), 2148532224bv32), 31bv32) == 0bv32))) && ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 785398163397448279/250000000000000000) == pi) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven - InvariantResult [Line: 78]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 263]: Loop Invariant [2022-07-12 02:58:20,775 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2022-07-12 02:58:20,775 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~2#1.base_7,QUANTIFIED] [2022-07-12 02:58:20,775 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2022-07-12 02:58:20,775 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2022-07-12 02:58:20,775 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2022-07-12 02:58:20,775 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 02:58:20,776 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:58:20,776 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:58:20,777 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2022-07-12 02:58:20,777 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~2#1.base_7,QUANTIFIED] [2022-07-12 02:58:20,777 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2022-07-12 02:58:20,777 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2022-07-12 02:58:20,778 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2022-07-12 02:58:20,778 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 02:58:20,778 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:58:20,778 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] Derived loop invariant: ((((~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) == tiny_atan2 && (\exists v_skolemized_q#valueAsBitvector_33 : bv64, v_ULTIMATE.start_isinf_double_~#ew_u~2#1.base_7 : bv32 :: v_skolemized_q#valueAsBitvector_33[63:32] == unknown-#memory_int-unknown[v_ULTIMATE.start_isinf_double_~#ew_u~2#1.base_7][4bv32] && ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_33[63:63], v_skolemized_q#valueAsBitvector_33[62:52], v_skolemized_q#valueAsBitvector_33[51:0]) == x)) && ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 785398163397448279/250000000000000000) == pi) && x == y) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) && (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE()) == x) - InvariantResult [Line: 156]: Loop Invariant [2022-07-12 02:58:20,780 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-07-12 02:58:20,780 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-07-12 02:58:20,780 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-07-12 02:58:20,780 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-07-12 02:58:20,781 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7,QUANTIFIED] [2022-07-12 02:58:20,781 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-07-12 02:58:20,781 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7,QUANTIFIED] [2022-07-12 02:58:20,782 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7,QUANTIFIED] [2022-07-12 02:58:20,782 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7,QUANTIFIED] [2022-07-12 02:58:20,782 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-07-12 02:58:20,782 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-07-12 02:58:20,782 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-07-12 02:58:20,782 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-07-12 02:58:20,782 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:58:20,782 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:58:20,783 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_124,QUANTIFIED] [2022-07-12 02:58:20,784 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_124,QUANTIFIED] [2022-07-12 02:58:20,784 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_124,QUANTIFIED] [2022-07-12 02:58:20,784 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:58:20,784 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:58:20,784 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_124,QUANTIFIED] [2022-07-12 02:58:20,785 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_33,QUANTIFIED] [2022-07-12 02:58:20,785 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_33,QUANTIFIED] [2022-07-12 02:58:20,785 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 02:58:20,786 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-07-12 02:58:20,786 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-07-12 02:58:20,786 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-07-12 02:58:20,786 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-07-12 02:58:20,786 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7,QUANTIFIED] [2022-07-12 02:58:20,786 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-07-12 02:58:20,787 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7,QUANTIFIED] [2022-07-12 02:58:20,787 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7,QUANTIFIED] [2022-07-12 02:58:20,787 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7,QUANTIFIED] [2022-07-12 02:58:20,787 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-07-12 02:58:20,788 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-07-12 02:58:20,788 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-07-12 02:58:20,788 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_35,QUANTIFIED] [2022-07-12 02:58:20,788 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:58:20,788 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:58:20,788 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_124,QUANTIFIED] [2022-07-12 02:58:20,788 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_124,QUANTIFIED] [2022-07-12 02:58:20,788 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_124,QUANTIFIED] [2022-07-12 02:58:20,789 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:58:20,789 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:58:20,789 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_124,QUANTIFIED] [2022-07-12 02:58:20,789 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_33,QUANTIFIED] [2022-07-12 02:58:20,789 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_33,QUANTIFIED] [2022-07-12 02:58:20,789 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: (((((~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) == tiny_atan2 && ~fp.lt~DOUBLE(y, ~Pluszero~LONGDOUBLE())) && (\exists v_skolemized_q#valueAsBitvector_34 : bv64 :: y == ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_34[63:63], v_skolemized_q#valueAsBitvector_34[62:52], v_skolemized_q#valueAsBitvector_34[51:0]) && !(~bvlshr32(~bvadd64(2148532224bv32, ~bvand32(v_skolemized_q#valueAsBitvector_34[63:32], 2147483647bv32)), 31bv32) == 0bv32))) && ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 785398163397448279/250000000000000000) == pi) && (\exists v_skolemized_q#valueAsBitvector_35 : bv64, v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7 : bv32, currentRoundingMode : FloatRoundingMode :: (((unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7][4bv32] == v_skolemized_q#valueAsBitvector_35[63:32] && ix == ~bvand32(unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7][4bv32], 2147483647bv32)) && lx == unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7][0bv32]) && unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_7][0bv32] == v_skolemized_q#valueAsBitvector_35[31:0]) && ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_35[63:63], v_skolemized_q#valueAsBitvector_35[62:52], v_skolemized_q#valueAsBitvector_35[51:0]) == ~fp.div~DOUBLE(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE()))) && (\exists v_skolemized_q#valueAsBitvector_124 : bv64, v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_33 : bv32, currentRoundingMode : FloatRoundingMode :: (~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_124[63:63], v_skolemized_q#valueAsBitvector_124[62:52], v_skolemized_q#valueAsBitvector_124[51:0]) == ~fp.div~DOUBLE(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE()) && v_skolemized_q#valueAsBitvector_124[63:32] == unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_33][4bv32]) && hx == unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_33][4bv32])) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven - InvariantResult [Line: 261]: Loop Invariant [2022-07-12 02:58:20,792 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-07-12 02:58:20,792 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6,QUANTIFIED] [2022-07-12 02:58:20,792 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-07-12 02:58:20,792 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-07-12 02:58:20,793 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-07-12 02:58:20,793 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6,QUANTIFIED] [2022-07-12 02:58:20,793 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 02:58:20,793 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:58:20,793 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:58:20,794 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-07-12 02:58:20,794 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6,QUANTIFIED] [2022-07-12 02:58:20,794 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-07-12 02:58:20,795 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-07-12 02:58:20,795 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_34,QUANTIFIED] [2022-07-12 02:58:20,795 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6,QUANTIFIED] [2022-07-12 02:58:20,795 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 02:58:20,796 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:58:20,796 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] Derived loop invariant: (((~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) == tiny_atan2 && (\exists v_skolemized_q#valueAsBitvector_34 : bv64, v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6 : bv32 :: (v_skolemized_q#valueAsBitvector_34[63:32] == unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6][4bv32] && ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_34[63:63], v_skolemized_q#valueAsBitvector_34[62:52], v_skolemized_q#valueAsBitvector_34[51:0]) == y) && \result == ~bvlshr32(~bvadd64(~bvand32(2147483647bv32, unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_double_~#gh_u~3#1.base_6][4bv32]), 2148532224bv32), 31bv32))) && ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 785398163397448279/250000000000000000) == pi) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) && (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE()) == x) - InvariantResult [Line: 271]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 226]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 247]: Loop Invariant [2022-07-12 02:58:20,797 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2022-07-12 02:58:20,797 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~2#1.base_7,QUANTIFIED] [2022-07-12 02:58:20,797 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2022-07-12 02:58:20,797 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2022-07-12 02:58:20,797 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2022-07-12 02:58:20,798 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 02:58:20,798 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:58:20,798 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:58:20,798 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2022-07-12 02:58:20,799 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~2#1.base_7,QUANTIFIED] [2022-07-12 02:58:20,799 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2022-07-12 02:58:20,800 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2022-07-12 02:58:20,800 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2022-07-12 02:58:20,800 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 02:58:20,800 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:58:20,800 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] Derived loop invariant: (((~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) == tiny_atan2 && (\exists v_skolemized_q#valueAsBitvector_33 : bv64, v_ULTIMATE.start_isinf_double_~#ew_u~2#1.base_7 : bv32 :: v_skolemized_q#valueAsBitvector_33[63:32] == unknown-#memory_int-unknown[v_ULTIMATE.start_isinf_double_~#ew_u~2#1.base_7][4bv32] && ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_33[63:63], v_skolemized_q#valueAsBitvector_33[62:52], v_skolemized_q#valueAsBitvector_33[51:0]) == x)) && ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 785398163397448279/250000000000000000) == pi) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) && (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE()) == x) - InvariantResult [Line: 70]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 144]: Loop Invariant [2022-07-12 02:58:20,801 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 02:58:20,801 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 02:58:20,802 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 02:58:20,802 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 02:58:20,802 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 02:58:20,802 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ((~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) == tiny_atan2 && \result == ~fp.sub~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(pi), ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000))) && ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 785398163397448279/250000000000000000) == pi) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 249]: Loop Invariant [2022-07-12 02:58:20,805 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 02:58:20,805 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:58:20,805 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:58:20,806 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 02:58:20,806 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:58:20,806 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] Derived loop invariant: (((~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) == tiny_atan2 && x == x) && ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 785398163397448279/250000000000000000) == pi) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) && (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE()) == x) RESULT: Ultimate proved your program to be correct! [2022-07-12 02:58:21,027 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2022-07-12 02:58:21,100 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE