./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/double_req_bl_0661a.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c3fed411 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_0661a.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 97db4649e1472818bc0988249575733f0ee094f6677a6f3f19d9bb4aec20f92d --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-17 07:30:47,010 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-17 07:30:47,011 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-17 07:30:47,038 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-17 07:30:47,048 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-17 07:30:47,049 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-17 07:30:47,050 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-17 07:30:47,051 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-17 07:30:47,052 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-17 07:30:47,053 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-17 07:30:47,054 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-17 07:30:47,055 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-17 07:30:47,055 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-17 07:30:47,062 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-17 07:30:47,063 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-17 07:30:47,064 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-17 07:30:47,064 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-17 07:30:47,065 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-17 07:30:47,066 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-17 07:30:47,067 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-17 07:30:47,068 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-17 07:30:47,072 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-17 07:30:47,072 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-17 07:30:47,073 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-17 07:30:47,075 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-17 07:30:47,075 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-17 07:30:47,075 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-17 07:30:47,076 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-17 07:30:47,076 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-17 07:30:47,077 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-17 07:30:47,077 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-17 07:30:47,078 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-17 07:30:47,078 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-17 07:30:47,079 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-17 07:30:47,079 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-17 07:30:47,080 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-17 07:30:47,080 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-17 07:30:47,080 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-17 07:30:47,081 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-17 07:30:47,081 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-17 07:30:47,082 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-17 07:30:47,083 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-17 07:30:47,097 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-17 07:30:47,097 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-17 07:30:47,098 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-17 07:30:47,098 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-17 07:30:47,099 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-17 07:30:47,099 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-17 07:30:47,099 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-17 07:30:47,099 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-17 07:30:47,100 INFO L138 SettingsManager]: * Use SBE=true [2021-12-17 07:30:47,100 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-17 07:30:47,100 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-17 07:30:47,100 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-17 07:30:47,100 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-17 07:30:47,100 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-17 07:30:47,101 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-17 07:30:47,101 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-17 07:30:47,101 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-17 07:30:47,101 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-17 07:30:47,101 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-17 07:30:47,102 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-17 07:30:47,102 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-17 07:30:47,102 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-17 07:30:47,102 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-17 07:30:47,102 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-17 07:30:47,102 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 07:30:47,103 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-17 07:30:47,103 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-17 07:30:47,103 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-17 07:30:47,103 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-17 07:30:47,103 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-17 07:30:47,104 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-17 07:30:47,104 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-17 07:30:47,104 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-17 07:30:47,104 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-17 07:30:47,104 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 -> 97db4649e1472818bc0988249575733f0ee094f6677a6f3f19d9bb4aec20f92d [2021-12-17 07:30:47,306 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-17 07:30:47,330 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-17 07:30:47,333 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-17 07:30:47,334 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-17 07:30:47,334 INFO L275 PluginConnector]: CDTParser initialized [2021-12-17 07:30:47,335 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_0661a.c [2021-12-17 07:30:47,387 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2c54f102/682ed4e36da045d18b811e918ae4c207/FLAGc3d22057b [2021-12-17 07:30:47,784 INFO L306 CDTParser]: Found 1 translation units. [2021-12-17 07:30:47,784 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_0661a.c [2021-12-17 07:30:47,796 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2c54f102/682ed4e36da045d18b811e918ae4c207/FLAGc3d22057b [2021-12-17 07:30:47,809 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2c54f102/682ed4e36da045d18b811e918ae4c207 [2021-12-17 07:30:47,812 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-17 07:30:47,814 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-17 07:30:47,816 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-17 07:30:47,816 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-17 07:30:47,818 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-17 07:30:47,819 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 07:30:47" (1/1) ... [2021-12-17 07:30:47,819 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d222232 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:30:47, skipping insertion in model container [2021-12-17 07:30:47,819 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 07:30:47" (1/1) ... [2021-12-17 07:30:47,824 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-17 07:30:47,843 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-17 07:30:47,995 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_0661a.c[6446,6459] [2021-12-17 07:30:47,997 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 07:30:48,003 INFO L203 MainTranslator]: Completed pre-run [2021-12-17 07:30:48,036 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_0661a.c[6446,6459] [2021-12-17 07:30:48,036 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 07:30:48,048 INFO L208 MainTranslator]: Completed translation [2021-12-17 07:30:48,048 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:30:48 WrapperNode [2021-12-17 07:30:48,048 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-17 07:30:48,049 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-17 07:30:48,049 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-17 07:30:48,049 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-17 07:30:48,055 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:30:48" (1/1) ... [2021-12-17 07:30:48,064 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:30:48" (1/1) ... [2021-12-17 07:30:48,084 INFO L137 Inliner]: procedures = 20, calls = 92, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 251 [2021-12-17 07:30:48,084 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-17 07:30:48,085 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-17 07:30:48,085 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-17 07:30:48,085 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-17 07:30:48,090 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:30:48" (1/1) ... [2021-12-17 07:30:48,090 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:30:48" (1/1) ... [2021-12-17 07:30:48,094 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:30:48" (1/1) ... [2021-12-17 07:30:48,094 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:30:48" (1/1) ... [2021-12-17 07:30:48,103 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:30:48" (1/1) ... [2021-12-17 07:30:48,108 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:30:48" (1/1) ... [2021-12-17 07:30:48,110 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:30:48" (1/1) ... [2021-12-17 07:30:48,112 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-17 07:30:48,113 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-17 07:30:48,113 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-17 07:30:48,113 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-17 07:30:48,114 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:30:48" (1/1) ... [2021-12-17 07:30:48,134 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 07:30:48,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 07:30:48,155 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) [2021-12-17 07:30:48,157 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 [2021-12-17 07:30:48,183 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-17 07:30:48,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-17 07:30:48,184 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-17 07:30:48,184 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2021-12-17 07:30:48,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-17 07:30:48,185 INFO L130 BoogieDeclarations]: Found specification of procedure fabs_double [2021-12-17 07:30:48,188 INFO L138 BoogieDeclarations]: Found implementation of procedure fabs_double [2021-12-17 07:30:48,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2021-12-17 07:30:48,189 INFO L130 BoogieDeclarations]: Found specification of procedure atan_double [2021-12-17 07:30:48,189 INFO L138 BoogieDeclarations]: Found implementation of procedure atan_double [2021-12-17 07:30:48,189 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-17 07:30:48,189 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-17 07:30:48,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-17 07:30:48,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2021-12-17 07:30:48,190 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-17 07:30:48,289 INFO L236 CfgBuilder]: Building ICFG [2021-12-17 07:30:48,291 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-17 07:30:48,662 INFO L277 CfgBuilder]: Performing block encoding [2021-12-17 07:30:48,671 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-17 07:30:48,673 INFO L301 CfgBuilder]: Removed 18 assume(true) statements. [2021-12-17 07:30:48,674 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 07:30:48 BoogieIcfgContainer [2021-12-17 07:30:48,675 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-17 07:30:48,678 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-17 07:30:48,678 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-17 07:30:48,680 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-17 07:30:48,680 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.12 07:30:47" (1/3) ... [2021-12-17 07:30:48,681 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@798e82cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 07:30:48, skipping insertion in model container [2021-12-17 07:30:48,681 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:30:48" (2/3) ... [2021-12-17 07:30:48,681 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@798e82cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 07:30:48, skipping insertion in model container [2021-12-17 07:30:48,681 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 07:30:48" (3/3) ... [2021-12-17 07:30:48,683 INFO L111 eAbstractionObserver]: Analyzing ICFG double_req_bl_0661a.c [2021-12-17 07:30:48,687 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-17 07:30:48,687 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-17 07:30:48,721 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-17 07:30:48,725 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-17 07:30:48,726 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-17 07:30:48,744 INFO L276 IsEmpty]: Start isEmpty. Operand has 99 states, 91 states have (on average 1.6593406593406594) internal successors, (151), 92 states have internal predecessors, (151), 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) [2021-12-17 07:30:48,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-17 07:30:48,747 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 07:30:48,748 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 07:30:48,748 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 07:30:48,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 07:30:48,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1101750833, now seen corresponding path program 1 times [2021-12-17 07:30:48,757 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 07:30:48,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959586440] [2021-12-17 07:30:48,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 07:30:48,759 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 07:30:48,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 07:30:48,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 07:30:48,900 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 07:30:48,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959586440] [2021-12-17 07:30:48,901 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959586440] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 07:30:48,901 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 07:30:48,901 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-17 07:30:48,903 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268451065] [2021-12-17 07:30:48,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 07:30:48,907 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-17 07:30:48,908 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 07:30:48,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-17 07:30:48,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-17 07:30:48,933 INFO L87 Difference]: Start difference. First operand has 99 states, 91 states have (on average 1.6593406593406594) internal successors, (151), 92 states have internal predecessors, (151), 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 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 07:30:48,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 07:30:48,971 INFO L93 Difference]: Finished difference Result 195 states and 318 transitions. [2021-12-17 07:30:48,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-17 07:30:48,972 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-12-17 07:30:48,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 07:30:48,978 INFO L225 Difference]: With dead ends: 195 [2021-12-17 07:30:48,978 INFO L226 Difference]: Without dead ends: 95 [2021-12-17 07:30:48,981 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-17 07:30:48,983 INFO L933 BasicCegarLoop]: 140 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, 140 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 [2021-12-17 07:30:48,984 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 07:30:48,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2021-12-17 07:30:49,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2021-12-17 07:30:49,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 88 states have (on average 1.4431818181818181) internal successors, (127), 88 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) [2021-12-17 07:30:49,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 135 transitions. [2021-12-17 07:30:49,012 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 135 transitions. Word has length 12 [2021-12-17 07:30:49,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 07:30:49,013 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 135 transitions. [2021-12-17 07:30:49,013 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 07:30:49,013 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 135 transitions. [2021-12-17 07:30:49,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-17 07:30:49,015 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 07:30:49,015 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 07:30:49,015 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-17 07:30:49,015 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 07:30:49,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 07:30:49,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1195087928, now seen corresponding path program 1 times [2021-12-17 07:30:49,018 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 07:30:49,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680817548] [2021-12-17 07:30:49,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 07:30:49,019 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 07:30:49,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-17 07:30:49,063 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-17 07:30:49,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-17 07:30:49,108 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-17 07:30:49,108 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-17 07:30:49,109 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-17 07:30:49,110 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-17 07:30:49,113 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1] [2021-12-17 07:30:49,115 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-17 07:30:49,138 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.12 07:30:49 BoogieIcfgContainer [2021-12-17 07:30:49,138 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-17 07:30:49,139 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-17 07:30:49,139 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-17 07:30:49,139 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-17 07:30:49,139 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 07:30:48" (3/4) ... [2021-12-17 07:30:49,141 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-17 07:30:49,142 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-17 07:30:49,142 INFO L158 Benchmark]: Toolchain (without parser) took 1328.59ms. Allocated memory was 96.5MB in the beginning and 138.4MB in the end (delta: 41.9MB). Free memory was 69.8MB in the beginning and 74.7MB in the end (delta: -4.9MB). Peak memory consumption was 37.6MB. Max. memory is 16.1GB. [2021-12-17 07:30:49,143 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 96.5MB. Free memory was 52.9MB in the beginning and 52.9MB in the end (delta: 48.0kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-17 07:30:49,143 INFO L158 Benchmark]: CACSL2BoogieTranslator took 232.83ms. Allocated memory is still 96.5MB. Free memory was 69.6MB in the beginning and 68.5MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-17 07:30:49,143 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.05ms. Allocated memory is still 96.5MB. Free memory was 68.5MB in the beginning and 66.0MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-17 07:30:49,144 INFO L158 Benchmark]: Boogie Preprocessor took 27.75ms. Allocated memory is still 96.5MB. Free memory was 66.0MB in the beginning and 63.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-17 07:30:49,145 INFO L158 Benchmark]: RCFGBuilder took 562.40ms. Allocated memory was 96.5MB in the beginning and 138.4MB in the end (delta: 41.9MB). Free memory was 63.3MB in the beginning and 109.6MB in the end (delta: -46.3MB). Peak memory consumption was 21.8MB. Max. memory is 16.1GB. [2021-12-17 07:30:49,146 INFO L158 Benchmark]: TraceAbstraction took 460.63ms. Allocated memory is still 138.4MB. Free memory was 109.6MB in the beginning and 74.7MB in the end (delta: 34.9MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2021-12-17 07:30:49,147 INFO L158 Benchmark]: Witness Printer took 3.02ms. Allocated memory is still 138.4MB. Free memory is still 74.7MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-17 07:30:49,156 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 96.5MB. Free memory was 52.9MB in the beginning and 52.9MB in the end (delta: 48.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 232.83ms. Allocated memory is still 96.5MB. Free memory was 69.6MB in the beginning and 68.5MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.05ms. Allocated memory is still 96.5MB. Free memory was 68.5MB in the beginning and 66.0MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.75ms. Allocated memory is still 96.5MB. Free memory was 66.0MB in the beginning and 63.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 562.40ms. Allocated memory was 96.5MB in the beginning and 138.4MB in the end (delta: 41.9MB). Free memory was 63.3MB in the beginning and 109.6MB in the end (delta: -46.3MB). Peak memory consumption was 21.8MB. Max. memory is 16.1GB. * TraceAbstraction took 460.63ms. Allocated memory is still 138.4MB. Free memory was 109.6MB in the beginning and 74.7MB in the end (delta: 34.9MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * Witness Printer took 3.02ms. Allocated memory is still 138.4MB. Free memory is still 74.7MB. 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: 273]: 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 267, overapproximation of bitwiseAnd at line 162, overapproximation of someBinaryArithmeticDOUBLEoperation at line 165, overapproximation of someBinaryDOUBLEComparisonOperation at line 272. 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] [L266] double x = __VERIFIER_nondet_double(); [L267] double y = -0.0; 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] [L269] COND TRUE x > 0.0 [L270] 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)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002, \old(y)=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=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002, y=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001, 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)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002, \old(y)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, hx=-2, lx=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000005, 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=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002, y=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001, 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)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002, \old(y)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, hx=-2, hy=-1, lx=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000005, ly=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000004, 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=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002, y=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001, zero_atan2=0] [L163-L164] COND TRUE ((ix | ((lx | -lx) >> 31)) > 0x7ff00000) || ((iy | ((ly | -ly) >> 31)) > 0x7ff00000) [L165] return x + y; VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002, \old(y)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, hx=-2, hy=-1, lx=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000005, ly=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000004, 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=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002, y=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001, zero_atan2=0] [L270] RET, EXPR __ieee754_atan2(y, x) [L270] double res = __ieee754_atan2(y, x); [L272] EXPR res == -0.0 && __signbit_double(res) == 1 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=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003, res == -0.0 && __signbit_double(res) == 1=0, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002, y=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001, zero_atan2=0] [L272] COND TRUE !(res == -0.0 && __signbit_double(res) == 1) [L273] 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=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002, y=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001, zero_atan2=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 99 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.4s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 140 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 140 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=99occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 26 NumberOfCodeBlocks, 26 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 11 ConstructedInterpolants, 0 QuantifiedInterpolants, 11 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 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 [2021-12-17 07:30:49,188 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/double_req_bl_0661a.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 97db4649e1472818bc0988249575733f0ee094f6677a6f3f19d9bb4aec20f92d --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-17 07:30:50,868 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-17 07:30:50,870 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-17 07:30:50,901 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-17 07:30:50,902 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-17 07:30:50,905 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-17 07:30:50,906 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-17 07:30:50,909 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-17 07:30:50,911 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-17 07:30:50,915 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-17 07:30:50,916 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-17 07:30:50,917 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-17 07:30:50,917 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-17 07:30:50,920 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-17 07:30:50,921 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-17 07:30:50,925 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-17 07:30:50,926 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-17 07:30:50,926 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-17 07:30:50,928 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-17 07:30:50,932 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-17 07:30:50,934 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-17 07:30:50,934 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-17 07:30:50,936 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-17 07:30:50,936 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-17 07:30:50,941 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-17 07:30:50,942 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-17 07:30:50,942 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-17 07:30:50,952 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-17 07:30:50,952 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-17 07:30:50,953 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-17 07:30:50,953 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-17 07:30:50,953 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-17 07:30:50,955 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-17 07:30:50,955 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-17 07:30:50,956 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-17 07:30:50,956 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-17 07:30:50,957 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-17 07:30:50,957 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-17 07:30:50,957 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-17 07:30:50,959 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-17 07:30:50,959 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-17 07:30:50,960 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2021-12-17 07:30:50,989 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-17 07:30:50,989 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-17 07:30:50,990 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-17 07:30:50,990 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-17 07:30:50,991 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-17 07:30:50,991 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-17 07:30:50,992 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-17 07:30:50,992 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-17 07:30:50,992 INFO L138 SettingsManager]: * Use SBE=true [2021-12-17 07:30:50,992 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-17 07:30:50,993 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-17 07:30:50,993 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-17 07:30:50,993 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-17 07:30:50,993 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-17 07:30:50,994 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-17 07:30:50,994 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-17 07:30:50,994 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-17 07:30:50,994 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-17 07:30:50,994 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-17 07:30:50,994 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-17 07:30:50,994 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-17 07:30:50,994 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-17 07:30:50,995 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-17 07:30:50,995 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-17 07:30:50,995 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-17 07:30:50,995 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-17 07:30:50,995 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 07:30:50,995 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-17 07:30:50,995 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-17 07:30:50,996 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-17 07:30:50,996 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-17 07:30:50,996 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-17 07:30:50,996 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-17 07:30:50,996 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-17 07:30:50,996 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-17 07:30:50,997 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-17 07:30:50,997 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-17 07:30:50,997 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 -> 97db4649e1472818bc0988249575733f0ee094f6677a6f3f19d9bb4aec20f92d [2021-12-17 07:30:51,254 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-17 07:30:51,271 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-17 07:30:51,274 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-17 07:30:51,275 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-17 07:30:51,275 INFO L275 PluginConnector]: CDTParser initialized [2021-12-17 07:30:51,276 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_0661a.c [2021-12-17 07:30:51,320 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea5ca0400/368c3cbff7a74290884028144edf0e1e/FLAG828bc7fdf [2021-12-17 07:30:51,662 INFO L306 CDTParser]: Found 1 translation units. [2021-12-17 07:30:51,663 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_0661a.c [2021-12-17 07:30:51,668 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea5ca0400/368c3cbff7a74290884028144edf0e1e/FLAG828bc7fdf [2021-12-17 07:30:51,678 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea5ca0400/368c3cbff7a74290884028144edf0e1e [2021-12-17 07:30:51,682 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-17 07:30:51,683 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-17 07:30:51,685 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-17 07:30:51,685 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-17 07:30:51,688 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-17 07:30:51,688 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 07:30:51" (1/1) ... [2021-12-17 07:30:51,690 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e99fff4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:30:51, skipping insertion in model container [2021-12-17 07:30:51,690 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 07:30:51" (1/1) ... [2021-12-17 07:30:51,695 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-17 07:30:51,723 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-17 07:30:51,940 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_0661a.c[6446,6459] [2021-12-17 07:30:51,946 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 07:30:51,959 INFO L203 MainTranslator]: Completed pre-run [2021-12-17 07:30:52,006 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_0661a.c[6446,6459] [2021-12-17 07:30:52,007 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 07:30:52,031 INFO L208 MainTranslator]: Completed translation [2021-12-17 07:30:52,031 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:30:52 WrapperNode [2021-12-17 07:30:52,032 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-17 07:30:52,033 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-17 07:30:52,033 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-17 07:30:52,033 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-17 07:30:52,037 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:30:52" (1/1) ... [2021-12-17 07:30:52,063 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:30:52" (1/1) ... [2021-12-17 07:30:52,091 INFO L137 Inliner]: procedures = 23, calls = 92, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 251 [2021-12-17 07:30:52,091 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-17 07:30:52,093 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-17 07:30:52,093 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-17 07:30:52,093 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-17 07:30:52,099 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:30:52" (1/1) ... [2021-12-17 07:30:52,099 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:30:52" (1/1) ... [2021-12-17 07:30:52,110 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:30:52" (1/1) ... [2021-12-17 07:30:52,110 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:30:52" (1/1) ... [2021-12-17 07:30:52,130 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:30:52" (1/1) ... [2021-12-17 07:30:52,142 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:30:52" (1/1) ... [2021-12-17 07:30:52,146 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:30:52" (1/1) ... [2021-12-17 07:30:52,151 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-17 07:30:52,154 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-17 07:30:52,155 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-17 07:30:52,156 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-17 07:30:52,156 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:30:52" (1/1) ... [2021-12-17 07:30:52,161 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 07:30:52,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 07:30:52,177 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) [2021-12-17 07:30:52,180 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 [2021-12-17 07:30:52,203 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-17 07:30:52,203 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2021-12-17 07:30:52,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2021-12-17 07:30:52,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-17 07:30:52,204 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-17 07:30:52,204 INFO L130 BoogieDeclarations]: Found specification of procedure fabs_double [2021-12-17 07:30:52,204 INFO L138 BoogieDeclarations]: Found implementation of procedure fabs_double [2021-12-17 07:30:52,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8 [2021-12-17 07:30:52,204 INFO L130 BoogieDeclarations]: Found specification of procedure atan_double [2021-12-17 07:30:52,204 INFO L138 BoogieDeclarations]: Found implementation of procedure atan_double [2021-12-17 07:30:52,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-12-17 07:30:52,204 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-17 07:30:52,204 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-17 07:30:52,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-12-17 07:30:52,204 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-17 07:30:52,299 INFO L236 CfgBuilder]: Building ICFG [2021-12-17 07:30:52,301 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-17 07:31:16,959 INFO L277 CfgBuilder]: Performing block encoding [2021-12-17 07:31:16,963 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-17 07:31:16,963 INFO L301 CfgBuilder]: Removed 18 assume(true) statements. [2021-12-17 07:31:16,964 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 07:31:16 BoogieIcfgContainer [2021-12-17 07:31:16,964 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-17 07:31:16,965 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-17 07:31:16,966 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-17 07:31:16,967 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-17 07:31:16,967 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.12 07:30:51" (1/3) ... [2021-12-17 07:31:16,968 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15b41de3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 07:31:16, skipping insertion in model container [2021-12-17 07:31:16,968 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:30:52" (2/3) ... [2021-12-17 07:31:16,968 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15b41de3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 07:31:16, skipping insertion in model container [2021-12-17 07:31:16,968 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 07:31:16" (3/3) ... [2021-12-17 07:31:16,969 INFO L111 eAbstractionObserver]: Analyzing ICFG double_req_bl_0661a.c [2021-12-17 07:31:16,974 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-17 07:31:16,974 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-17 07:31:17,022 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-17 07:31:17,028 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-17 07:31:17,028 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-17 07:31:17,042 INFO L276 IsEmpty]: Start isEmpty. Operand has 99 states, 91 states have (on average 1.6593406593406594) internal successors, (151), 92 states have internal predecessors, (151), 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) [2021-12-17 07:31:17,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-17 07:31:17,046 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 07:31:17,046 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 07:31:17,047 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 07:31:17,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 07:31:17,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1101750833, now seen corresponding path program 1 times [2021-12-17 07:31:17,061 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 07:31:17,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1135921695] [2021-12-17 07:31:17,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 07:31:17,063 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 07:31:17,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 07:31:17,068 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) [2021-12-17 07:31:17,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-12-17 07:31:17,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 07:31:17,355 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 1 conjunts are in the unsatisfiable core [2021-12-17 07:31:17,358 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 07:31:17,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 07:31:17,633 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 07:31:17,634 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 07:31:17,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1135921695] [2021-12-17 07:31:17,634 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1135921695] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 07:31:17,634 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 07:31:17,634 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-17 07:31:17,635 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918663247] [2021-12-17 07:31:17,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 07:31:17,638 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-17 07:31:17,639 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 07:31:17,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-17 07:31:17,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-17 07:31:17,667 INFO L87 Difference]: Start difference. First operand has 99 states, 91 states have (on average 1.6593406593406594) internal successors, (151), 92 states have internal predecessors, (151), 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 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 07:31:17,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 07:31:17,699 INFO L93 Difference]: Finished difference Result 195 states and 318 transitions. [2021-12-17 07:31:17,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-17 07:31:17,700 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-12-17 07:31:17,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 07:31:17,705 INFO L225 Difference]: With dead ends: 195 [2021-12-17 07:31:17,706 INFO L226 Difference]: Without dead ends: 95 [2021-12-17 07:31:17,708 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-17 07:31:17,711 INFO L933 BasicCegarLoop]: 140 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, 140 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 [2021-12-17 07:31:17,712 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 07:31:17,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2021-12-17 07:31:17,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2021-12-17 07:31:17,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 88 states have (on average 1.4431818181818181) internal successors, (127), 88 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) [2021-12-17 07:31:17,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 135 transitions. [2021-12-17 07:31:17,740 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 135 transitions. Word has length 12 [2021-12-17 07:31:17,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 07:31:17,740 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 135 transitions. [2021-12-17 07:31:17,741 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 07:31:17,741 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 135 transitions. [2021-12-17 07:31:17,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-17 07:31:17,741 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 07:31:17,742 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 07:31:17,756 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-12-17 07:31:17,949 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 07:31:17,950 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 07:31:17,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 07:31:17,950 INFO L85 PathProgramCache]: Analyzing trace with hash -1195087928, now seen corresponding path program 1 times [2021-12-17 07:31:17,951 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 07:31:17,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [410662741] [2021-12-17 07:31:17,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 07:31:17,951 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 07:31:17,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 07:31:17,953 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) [2021-12-17 07:31:17,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-12-17 07:31:18,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 07:31:18,309 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 21 conjunts are in the unsatisfiable core [2021-12-17 07:31:18,312 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 07:31:19,260 INFO L388 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 16 treesize of output 17 [2021-12-17 07:31:22,675 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 07:31:22,676 INFO L388 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 [2021-12-17 07:31:24,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 07:31:24,824 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 07:31:24,824 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 07:31:24,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [410662741] [2021-12-17 07:31:24,824 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [410662741] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 07:31:24,824 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 07:31:24,825 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-17 07:31:24,825 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102748961] [2021-12-17 07:31:24,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 07:31:24,826 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-17 07:31:24,826 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 07:31:24,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-17 07:31:24,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-17 07:31:24,826 INFO L87 Difference]: Start difference. First operand 95 states and 135 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 07:31:26,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 07:31:26,022 INFO L93 Difference]: Finished difference Result 104 states and 144 transitions. [2021-12-17 07:31:26,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-17 07:31:26,023 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-12-17 07:31:26,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 07:31:26,024 INFO L225 Difference]: With dead ends: 104 [2021-12-17 07:31:26,024 INFO L226 Difference]: Without dead ends: 95 [2021-12-17 07:31:26,025 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-12-17 07:31:26,025 INFO L933 BasicCegarLoop]: 128 mSDtfsCounter, 5 mSDsluCounter, 700 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 828 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 73 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 07:31:26,026 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 828 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 73 Unchecked, 0.1s Time] [2021-12-17 07:31:26,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2021-12-17 07:31:26,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2021-12-17 07:31:26,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 88 states have (on average 1.4318181818181819) internal successors, (126), 88 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) [2021-12-17 07:31:26,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 134 transitions. [2021-12-17 07:31:26,033 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 134 transitions. Word has length 14 [2021-12-17 07:31:26,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 07:31:26,033 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 134 transitions. [2021-12-17 07:31:26,033 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 07:31:26,033 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 134 transitions. [2021-12-17 07:31:26,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-17 07:31:26,034 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 07:31:26,034 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 07:31:26,048 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-12-17 07:31:26,238 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 07:31:26,239 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 07:31:26,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 07:31:26,240 INFO L85 PathProgramCache]: Analyzing trace with hash 2064728897, now seen corresponding path program 1 times [2021-12-17 07:31:26,240 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 07:31:26,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [315535991] [2021-12-17 07:31:26,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 07:31:26,240 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 07:31:26,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 07:31:26,241 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) [2021-12-17 07:31:26,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-12-17 07:31:26,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 07:31:26,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-17 07:31:26,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 07:31:28,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 07:31:28,356 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 07:31:28,356 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 07:31:28,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [315535991] [2021-12-17 07:31:28,356 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [315535991] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 07:31:28,356 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 07:31:28,357 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-17 07:31:28,357 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284770013] [2021-12-17 07:31:28,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 07:31:28,357 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-17 07:31:28,357 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 07:31:28,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-17 07:31:28,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-17 07:31:28,358 INFO L87 Difference]: Start difference. First operand 95 states and 134 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 07:31:28,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 07:31:28,986 INFO L93 Difference]: Finished difference Result 114 states and 153 transitions. [2021-12-17 07:31:28,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-17 07:31:28,986 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-12-17 07:31:28,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 07:31:28,987 INFO L225 Difference]: With dead ends: 114 [2021-12-17 07:31:28,987 INFO L226 Difference]: Without dead ends: 104 [2021-12-17 07:31:28,988 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-17 07:31:28,988 INFO L933 BasicCegarLoop]: 135 mSDtfsCounter, 75 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 7 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 07:31:28,989 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 456 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 7 Unchecked, 0.1s Time] [2021-12-17 07:31:28,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2021-12-17 07:31:28,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 95. [2021-12-17 07:31:28,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 88 states have (on average 1.4204545454545454) internal successors, (125), 88 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) [2021-12-17 07:31:28,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 133 transitions. [2021-12-17 07:31:28,997 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 133 transitions. Word has length 19 [2021-12-17 07:31:28,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 07:31:28,997 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 133 transitions. [2021-12-17 07:31:28,997 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 07:31:28,997 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 133 transitions. [2021-12-17 07:31:28,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-17 07:31:28,998 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 07:31:28,998 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 07:31:29,013 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-12-17 07:31:29,203 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 07:31:29,203 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 07:31:29,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 07:31:29,204 INFO L85 PathProgramCache]: Analyzing trace with hash 2007470595, now seen corresponding path program 1 times [2021-12-17 07:31:29,204 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 07:31:29,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [23954147] [2021-12-17 07:31:29,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 07:31:29,205 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 07:31:29,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 07:31:29,206 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) [2021-12-17 07:31:29,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-12-17 07:31:29,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 07:31:29,597 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-17 07:31:29,599 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 07:31:30,275 INFO L388 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 15 treesize of output 13 [2021-12-17 07:31:32,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 07:31:32,032 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 07:31:32,033 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 07:31:32,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [23954147] [2021-12-17 07:31:32,033 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [23954147] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 07:31:32,033 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 07:31:32,033 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-17 07:31:32,033 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250823338] [2021-12-17 07:31:32,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 07:31:32,034 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-17 07:31:32,034 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 07:31:32,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-17 07:31:32,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-17 07:31:32,035 INFO L87 Difference]: Start difference. First operand 95 states and 133 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 07:31:32,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 07:31:32,760 INFO L93 Difference]: Finished difference Result 179 states and 248 transitions. [2021-12-17 07:31:32,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-17 07:31:32,761 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-12-17 07:31:32,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 07:31:32,764 INFO L225 Difference]: With dead ends: 179 [2021-12-17 07:31:32,764 INFO L226 Difference]: Without dead ends: 104 [2021-12-17 07:31:32,767 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-12-17 07:31:32,771 INFO L933 BasicCegarLoop]: 136 mSDtfsCounter, 19 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 15 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 07:31:32,771 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 647 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 15 Unchecked, 0.1s Time] [2021-12-17 07:31:32,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2021-12-17 07:31:32,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 95. [2021-12-17 07:31:32,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 88 states have (on average 1.4090909090909092) internal successors, (124), 88 states have internal predecessors, (124), 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) [2021-12-17 07:31:32,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 132 transitions. [2021-12-17 07:31:32,783 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 132 transitions. Word has length 19 [2021-12-17 07:31:32,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 07:31:32,784 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 132 transitions. [2021-12-17 07:31:32,786 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 07:31:32,787 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 132 transitions. [2021-12-17 07:31:32,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-17 07:31:32,788 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 07:31:32,788 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 07:31:32,804 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-12-17 07:31:33,005 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 07:31:33,005 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 07:31:33,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 07:31:33,006 INFO L85 PathProgramCache]: Analyzing trace with hash 681986241, now seen corresponding path program 1 times [2021-12-17 07:31:33,006 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 07:31:33,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1132340452] [2021-12-17 07:31:33,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 07:31:33,006 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 07:31:33,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 07:31:33,009 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) [2021-12-17 07:31:33,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-12-17 07:31:33,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 07:31:33,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-17 07:31:33,253 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 07:31:35,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 07:31:35,867 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 07:31:35,867 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 07:31:35,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1132340452] [2021-12-17 07:31:35,868 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1132340452] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 07:31:35,868 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 07:31:35,868 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-17 07:31:35,868 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816936299] [2021-12-17 07:31:35,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 07:31:35,868 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-17 07:31:35,868 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 07:31:35,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-17 07:31:35,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-17 07:31:35,869 INFO L87 Difference]: Start difference. First operand 95 states and 132 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 07:31:37,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 07:31:37,551 INFO L93 Difference]: Finished difference Result 184 states and 255 transitions. [2021-12-17 07:31:37,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-17 07:31:37,553 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-12-17 07:31:37,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 07:31:37,554 INFO L225 Difference]: With dead ends: 184 [2021-12-17 07:31:37,554 INFO L226 Difference]: Without dead ends: 104 [2021-12-17 07:31:37,555 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-17 07:31:37,555 INFO L933 BasicCegarLoop]: 133 mSDtfsCounter, 20 mSDsluCounter, 618 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 751 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 26 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-12-17 07:31:37,556 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 751 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 26 Unchecked, 1.0s Time] [2021-12-17 07:31:37,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2021-12-17 07:31:37,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 95. [2021-12-17 07:31:37,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 88 states have (on average 1.3977272727272727) internal successors, (123), 88 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) [2021-12-17 07:31:37,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 131 transitions. [2021-12-17 07:31:37,561 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 131 transitions. Word has length 19 [2021-12-17 07:31:37,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 07:31:37,561 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 131 transitions. [2021-12-17 07:31:37,561 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 07:31:37,561 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 131 transitions. [2021-12-17 07:31:37,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-17 07:31:37,561 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 07:31:37,561 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 07:31:37,576 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Ended with exit code 0 [2021-12-17 07:31:37,762 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 07:31:37,762 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 07:31:37,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 07:31:37,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1837973693, now seen corresponding path program 1 times [2021-12-17 07:31:37,763 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 07:31:37,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [736271286] [2021-12-17 07:31:37,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 07:31:37,773 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 07:31:37,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 07:31:37,774 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) [2021-12-17 07:31:37,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-12-17 07:31:37,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 07:31:37,983 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-17 07:31:37,984 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 07:31:39,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 07:31:39,797 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 07:31:39,798 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 07:31:39,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [736271286] [2021-12-17 07:31:39,798 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [736271286] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 07:31:39,798 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 07:31:39,798 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-17 07:31:39,798 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742576172] [2021-12-17 07:31:39,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 07:31:39,799 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-17 07:31:39,799 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 07:31:39,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-17 07:31:39,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-17 07:31:39,800 INFO L87 Difference]: Start difference. First operand 95 states and 131 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 07:31:44,802 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 07:31:47,861 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 07:31:49,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 07:31:49,588 INFO L93 Difference]: Finished difference Result 107 states and 142 transitions. [2021-12-17 07:31:49,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-17 07:31:49,588 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-12-17 07:31:49,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 07:31:49,589 INFO L225 Difference]: With dead ends: 107 [2021-12-17 07:31:49,589 INFO L226 Difference]: Without dead ends: 104 [2021-12-17 07:31:49,590 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-12-17 07:31:49,590 INFO L933 BasicCegarLoop]: 128 mSDtfsCounter, 177 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2021-12-17 07:31:49,590 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [177 Valid, 451 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 8.5s Time] [2021-12-17 07:31:49,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2021-12-17 07:31:49,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 97. [2021-12-17 07:31:49,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 90 states have (on average 1.3888888888888888) internal successors, (125), 90 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) [2021-12-17 07:31:49,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 133 transitions. [2021-12-17 07:31:49,599 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 133 transitions. Word has length 19 [2021-12-17 07:31:49,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 07:31:49,599 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 133 transitions. [2021-12-17 07:31:49,599 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 07:31:49,599 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 133 transitions. [2021-12-17 07:31:49,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-17 07:31:49,600 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 07:31:49,600 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 07:31:49,615 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2021-12-17 07:31:49,813 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 07:31:49,814 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 07:31:49,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 07:31:49,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1229096430, now seen corresponding path program 1 times [2021-12-17 07:31:49,815 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 07:31:49,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [681796864] [2021-12-17 07:31:49,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 07:31:49,815 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 07:31:49,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 07:31:49,816 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) [2021-12-17 07:31:49,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-12-17 07:31:50,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 07:31:50,106 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 19 conjunts are in the unsatisfiable core [2021-12-17 07:31:50,107 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 07:31:50,950 INFO L388 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 [2021-12-17 07:31:52,988 INFO L388 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 [2021-12-17 07:31:56,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 07:31:56,919 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 07:31:56,920 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 07:31:56,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [681796864] [2021-12-17 07:31:56,920 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [681796864] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 07:31:56,920 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 07:31:56,920 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-17 07:31:56,920 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171187951] [2021-12-17 07:31:56,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 07:31:56,920 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-17 07:31:56,920 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 07:31:56,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-17 07:31:56,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-17 07:31:56,921 INFO L87 Difference]: Start difference. First operand 97 states and 133 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 07:31:58,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 07:31:58,116 INFO L93 Difference]: Finished difference Result 145 states and 190 transitions. [2021-12-17 07:31:58,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-17 07:31:58,117 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-12-17 07:31:58,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 07:31:58,117 INFO L225 Difference]: With dead ends: 145 [2021-12-17 07:31:58,117 INFO L226 Difference]: Without dead ends: 67 [2021-12-17 07:31:58,118 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-12-17 07:31:58,118 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 14 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 27 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-17 07:31:58,118 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 402 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 27 Unchecked, 0.2s Time] [2021-12-17 07:31:58,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2021-12-17 07:31:58,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 60. [2021-12-17 07:31:58,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 55 states have (on average 1.2363636363636363) internal successors, (68), 55 states have internal predecessors, (68), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-17 07:31:58,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 72 transitions. [2021-12-17 07:31:58,121 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 72 transitions. Word has length 20 [2021-12-17 07:31:58,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 07:31:58,121 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 72 transitions. [2021-12-17 07:31:58,121 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 07:31:58,121 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 72 transitions. [2021-12-17 07:31:58,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-17 07:31:58,121 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 07:31:58,122 INFO L514 BasicCegarLoop]: 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] [2021-12-17 07:31:58,138 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-12-17 07:31:58,322 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 07:31:58,322 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 07:31:58,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 07:31:58,323 INFO L85 PathProgramCache]: Analyzing trace with hash -264541864, now seen corresponding path program 1 times [2021-12-17 07:31:58,323 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 07:31:58,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [821666709] [2021-12-17 07:31:58,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 07:31:58,323 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 07:31:58,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 07:31:58,324 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) [2021-12-17 07:31:58,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-12-17 07:31:58,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 07:31:58,570 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 16 conjunts are in the unsatisfiable core [2021-12-17 07:31:58,571 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 07:32:02,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 07:32:02,590 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 07:32:02,590 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 07:32:02,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [821666709] [2021-12-17 07:32:02,590 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [821666709] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 07:32:02,590 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 07:32:02,590 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-17 07:32:02,591 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93457636] [2021-12-17 07:32:02,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 07:32:02,591 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-17 07:32:02,591 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 07:32:02,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-17 07:32:02,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-12-17 07:32:02,592 INFO L87 Difference]: Start difference. First operand 60 states and 72 transitions. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 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) [2021-12-17 07:32:08,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 07:32:08,241 INFO L93 Difference]: Finished difference Result 70 states and 80 transitions. [2021-12-17 07:32:08,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-17 07:32:08,242 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 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 23 [2021-12-17 07:32:08,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 07:32:08,242 INFO L225 Difference]: With dead ends: 70 [2021-12-17 07:32:08,242 INFO L226 Difference]: Without dead ends: 57 [2021-12-17 07:32:08,243 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2021-12-17 07:32:08,243 INFO L933 BasicCegarLoop]: 62 mSDtfsCounter, 55 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 8 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2021-12-17 07:32:08,243 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 526 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 43 Invalid, 0 Unknown, 8 Unchecked, 2.4s Time] [2021-12-17 07:32:08,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2021-12-17 07:32:08,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 54. [2021-12-17 07:32:08,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 49 states have (on average 1.2448979591836735) internal successors, (61), 49 states have internal predecessors, (61), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-17 07:32:08,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 65 transitions. [2021-12-17 07:32:08,246 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 65 transitions. Word has length 23 [2021-12-17 07:32:08,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 07:32:08,246 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 65 transitions. [2021-12-17 07:32:08,246 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 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) [2021-12-17 07:32:08,246 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2021-12-17 07:32:08,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-17 07:32:08,247 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 07:32:08,247 INFO L514 BasicCegarLoop]: 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] [2021-12-17 07:32:08,264 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-12-17 07:32:08,455 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 07:32:08,456 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 07:32:08,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 07:32:08,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1017165070, now seen corresponding path program 1 times [2021-12-17 07:32:08,457 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 07:32:08,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1303317653] [2021-12-17 07:32:08,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 07:32:08,457 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 07:32:08,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 07:32:08,458 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) [2021-12-17 07:32:08,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-12-17 07:32:08,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 07:32:08,776 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-17 07:32:08,778 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 07:32:12,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 07:32:12,421 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 07:32:12,421 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 07:32:12,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1303317653] [2021-12-17 07:32:12,421 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1303317653] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 07:32:12,421 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 07:32:12,421 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-17 07:32:12,421 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970079036] [2021-12-17 07:32:12,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 07:32:12,421 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-17 07:32:12,422 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 07:32:12,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-17 07:32:12,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-17 07:32:12,422 INFO L87 Difference]: Start difference. First operand 54 states and 65 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 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) [2021-12-17 07:32:17,267 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.44s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-17 07:32:20,136 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 07:32:22,403 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.27s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-17 07:32:25,143 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.61s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 07:32:28,016 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.87s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 07:32:30,832 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.82s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 07:32:33,733 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 [] [2021-12-17 07:32:33,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 07:32:33,734 INFO L93 Difference]: Finished difference Result 66 states and 77 transitions. [2021-12-17 07:32:34,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-17 07:32:34,007 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 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 27 [2021-12-17 07:32:34,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 07:32:34,007 INFO L225 Difference]: With dead ends: 66 [2021-12-17 07:32:34,007 INFO L226 Difference]: Without dead ends: 50 [2021-12-17 07:32:34,008 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-12-17 07:32:34,008 INFO L933 BasicCegarLoop]: 59 mSDtfsCounter, 34 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 35 IncrementalHoareTripleChecker+Unchecked, 20.5s IncrementalHoareTripleChecker+Time [2021-12-17 07:32:34,008 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 332 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 7 Unknown, 35 Unchecked, 20.5s Time] [2021-12-17 07:32:34,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2021-12-17 07:32:34,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2021-12-17 07:32:34,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 45 states have (on average 1.2) internal successors, (54), 45 states have internal predecessors, (54), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-17 07:32:34,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 58 transitions. [2021-12-17 07:32:34,011 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 58 transitions. Word has length 27 [2021-12-17 07:32:34,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 07:32:34,011 INFO L470 AbstractCegarLoop]: Abstraction has 50 states and 58 transitions. [2021-12-17 07:32:34,011 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 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) [2021-12-17 07:32:34,012 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 58 transitions. [2021-12-17 07:32:34,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-17 07:32:34,012 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 07:32:34,012 INFO L514 BasicCegarLoop]: 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] [2021-12-17 07:32:34,032 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-12-17 07:32:34,212 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 07:32:34,213 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 07:32:34,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 07:32:34,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1603923085, now seen corresponding path program 1 times [2021-12-17 07:32:34,214 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 07:32:34,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1448227288] [2021-12-17 07:32:34,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 07:32:34,215 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 07:32:34,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 07:32:34,215 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) [2021-12-17 07:32:34,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-12-17 07:32:34,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 07:32:34,588 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-17 07:32:34,589 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 07:32:38,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 07:32:38,652 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 07:32:38,653 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 07:32:38,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1448227288] [2021-12-17 07:32:38,653 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1448227288] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 07:32:38,653 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 07:32:38,653 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-17 07:32:38,653 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224974148] [2021-12-17 07:32:38,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 07:32:38,653 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-17 07:32:38,654 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 07:32:38,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-17 07:32:38,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-17 07:32:38,654 INFO L87 Difference]: Start difference. First operand 50 states and 58 transitions. Second operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 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) [2021-12-17 07:32:46,514 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.61s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-17 07:32:50,246 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 07:32:52,248 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 07:32:54,520 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.27s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-17 07:32:59,677 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.67s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 07:33:02,572 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.89s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 07:33:05,441 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.87s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 07:33:08,359 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.92s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 07:33:08,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 07:33:08,360 INFO L93 Difference]: Finished difference Result 66 states and 73 transitions. [2021-12-17 07:33:08,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-17 07:33:08,621 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 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 27 [2021-12-17 07:33:08,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 07:33:08,621 INFO L225 Difference]: With dead ends: 66 [2021-12-17 07:33:08,621 INFO L226 Difference]: Without dead ends: 63 [2021-12-17 07:33:08,621 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2021-12-17 07:33:08,622 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 62 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 7 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.4s IncrementalHoareTripleChecker+Time [2021-12-17 07:33:08,622 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 336 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 64 Invalid, 8 Unknown, 0 Unchecked, 25.4s Time] [2021-12-17 07:33:08,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2021-12-17 07:33:08,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 55. [2021-12-17 07:33:08,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 49 states have (on average 1.183673469387755) internal successors, (58), 49 states have internal predecessors, (58), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-17 07:33:08,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2021-12-17 07:33:08,625 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 27 [2021-12-17 07:33:08,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 07:33:08,625 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2021-12-17 07:33:08,625 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 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) [2021-12-17 07:33:08,625 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2021-12-17 07:33:08,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-17 07:33:08,626 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 07:33:08,626 INFO L514 BasicCegarLoop]: 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] [2021-12-17 07:33:08,642 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Ended with exit code 0 [2021-12-17 07:33:08,826 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 07:33:08,826 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 07:33:08,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 07:33:08,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1890472593, now seen corresponding path program 1 times [2021-12-17 07:33:08,827 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 07:33:08,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1611200681] [2021-12-17 07:33:08,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 07:33:08,828 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 07:33:08,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 07:33:08,828 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) [2021-12-17 07:33:08,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-12-17 07:33:12,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 07:33:12,273 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-17 07:33:12,274 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 07:33:16,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 07:33:16,756 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 07:33:16,757 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 07:33:16,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1611200681] [2021-12-17 07:33:16,757 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1611200681] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 07:33:16,757 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 07:33:16,757 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-17 07:33:16,757 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569250860] [2021-12-17 07:33:16,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 07:33:16,757 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-17 07:33:16,757 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 07:33:16,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-17 07:33:16,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-17 07:33:16,758 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 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) [2021-12-17 07:33:22,147 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.50s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-17 07:33:25,006 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.86s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 07:33:27,258 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.25s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-17 07:33:30,031 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.64s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 07:33:32,938 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.91s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 07:33:34,823 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 07:33:37,695 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.87s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 07:33:37,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 07:33:37,695 INFO L93 Difference]: Finished difference Result 72 states and 82 transitions. [2021-12-17 07:33:37,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-17 07:33:37,955 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), 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 29 [2021-12-17 07:33:37,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 07:33:37,956 INFO L225 Difference]: With dead ends: 72 [2021-12-17 07:33:37,956 INFO L226 Difference]: Without dead ends: 55 [2021-12-17 07:33:37,956 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-12-17 07:33:37,957 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 35 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 33 IncrementalHoareTripleChecker+Unchecked, 20.0s IncrementalHoareTripleChecker+Time [2021-12-17 07:33:37,957 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 284 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 6 Unknown, 33 Unchecked, 20.0s Time] [2021-12-17 07:33:37,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2021-12-17 07:33:37,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2021-12-17 07:33:37,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 49 states have (on average 1.163265306122449) internal successors, (57), 49 states have internal predecessors, (57), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-17 07:33:37,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2021-12-17 07:33:37,959 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 62 transitions. Word has length 29 [2021-12-17 07:33:37,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 07:33:37,960 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 62 transitions. [2021-12-17 07:33:37,960 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 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) [2021-12-17 07:33:37,960 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2021-12-17 07:33:37,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-17 07:33:37,960 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 07:33:37,961 INFO L514 BasicCegarLoop]: 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] [2021-12-17 07:33:38,061 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-12-17 07:33:38,171 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 07:33:38,171 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 07:33:38,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 07:33:38,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1050564698, now seen corresponding path program 1 times [2021-12-17 07:33:38,172 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 07:33:38,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [922173423] [2021-12-17 07:33:38,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 07:33:38,172 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 07:33:38,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 07:33:38,173 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) [2021-12-17 07:33:38,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-12-17 07:33:41,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 07:33:41,996 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-17 07:33:41,997 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 07:34:18,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 07:34:18,972 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 07:34:18,972 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 07:34:18,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [922173423] [2021-12-17 07:34:18,973 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [922173423] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 07:34:18,973 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 07:34:18,973 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-17 07:34:18,973 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516984062] [2021-12-17 07:34:18,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 07:34:18,973 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-17 07:34:18,973 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 07:34:18,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-17 07:34:18,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-17 07:34:18,974 INFO L87 Difference]: Start difference. First operand 55 states and 62 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 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) [2021-12-17 07:34:33,609 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.63s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-17 07:34:36,562 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.95s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 07:34:38,871 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.31s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-17 07:34:40,088 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 [] [2021-12-17 07:34:43,125 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.71s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 07:34:46,093 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.97s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 07:34:48,962 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.87s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 07:34:51,893 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.93s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 07:34:51,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 07:34:51,894 INFO L93 Difference]: Finished difference Result 69 states and 77 transitions. [2021-12-17 07:34:52,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-17 07:34:52,168 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 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 30 [2021-12-17 07:34:52,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 07:34:52,169 INFO L225 Difference]: With dead ends: 69 [2021-12-17 07:34:52,169 INFO L226 Difference]: Without dead ends: 57 [2021-12-17 07:34:52,170 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 15.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2021-12-17 07:34:52,170 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 78 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 7 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 26.5s IncrementalHoareTripleChecker+Time [2021-12-17 07:34:52,170 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 152 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 38 Invalid, 7 Unknown, 0 Unchecked, 26.5s Time] [2021-12-17 07:34:52,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2021-12-17 07:34:52,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2021-12-17 07:34:52,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 51 states have (on average 1.1568627450980393) internal successors, (59), 51 states have internal predecessors, (59), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-17 07:34:52,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 64 transitions. [2021-12-17 07:34:52,173 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 64 transitions. Word has length 30 [2021-12-17 07:34:52,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 07:34:52,173 INFO L470 AbstractCegarLoop]: Abstraction has 57 states and 64 transitions. [2021-12-17 07:34:52,173 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 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) [2021-12-17 07:34:52,174 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2021-12-17 07:34:52,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-17 07:34:52,174 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 07:34:52,174 INFO L514 BasicCegarLoop]: 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] [2021-12-17 07:34:52,277 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-12-17 07:34:52,379 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 07:34:52,380 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 07:34:52,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 07:34:52,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1862870408, now seen corresponding path program 1 times [2021-12-17 07:34:52,380 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 07:34:52,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1380337062] [2021-12-17 07:34:52,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 07:34:52,381 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 07:34:52,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 07:34:52,382 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) [2021-12-17 07:34:52,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-12-17 07:34:52,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 07:34:52,781 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 20 conjunts are in the unsatisfiable core [2021-12-17 07:34:52,786 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 07:35:01,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 07:35:01,096 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 07:35:01,096 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 07:35:01,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1380337062] [2021-12-17 07:35:01,096 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1380337062] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 07:35:01,096 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 07:35:01,097 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-12-17 07:35:01,097 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34640626] [2021-12-17 07:35:01,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 07:35:01,097 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-17 07:35:01,097 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 07:35:01,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-17 07:35:01,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2021-12-17 07:35:01,098 INFO L87 Difference]: Start difference. First operand 57 states and 64 transitions. Second operand has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 12 states have internal predecessors, (29), 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) [2021-12-17 07:35:10,493 WARN L227 SmtUtils]: Spent 6.14s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 07:35:16,581 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.75s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-17 07:35:20,619 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-17 07:35:29,606 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.73s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 07:35:32,598 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.99s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 07:35:35,453 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.85s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 07:35:38,420 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.97s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 07:35:40,947 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 07:35:42,949 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 07:35:43,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 07:35:43,116 INFO L93 Difference]: Finished difference Result 67 states and 72 transitions. [2021-12-17 07:35:43,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-17 07:35:43,117 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 12 states have internal predecessors, (29), 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 31 [2021-12-17 07:35:43,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 07:35:43,117 INFO L225 Difference]: With dead ends: 67 [2021-12-17 07:35:43,118 INFO L226 Difference]: Without dead ends: 55 [2021-12-17 07:35:43,118 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 18.3s TimeCoverageRelationStatistics Valid=89, Invalid=373, Unknown=0, NotChecked=0, Total=462 [2021-12-17 07:35:43,118 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 53 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 8 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 27.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 13 IncrementalHoareTripleChecker+Unchecked, 29.6s IncrementalHoareTripleChecker+Time [2021-12-17 07:35:43,119 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 489 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 107 Invalid, 8 Unknown, 13 Unchecked, 29.6s Time] [2021-12-17 07:35:43,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2021-12-17 07:35:43,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 52. [2021-12-17 07:35:43,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 47 states have (on average 1.148936170212766) internal successors, (54), 47 states have internal predecessors, (54), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-17 07:35:43,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 58 transitions. [2021-12-17 07:35:43,121 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 58 transitions. Word has length 31 [2021-12-17 07:35:43,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 07:35:43,121 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 58 transitions. [2021-12-17 07:35:43,121 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 12 states have internal predecessors, (29), 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) [2021-12-17 07:35:43,121 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2021-12-17 07:35:43,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-17 07:35:43,122 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 07:35:43,122 INFO L514 BasicCegarLoop]: 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] [2021-12-17 07:35:43,140 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2021-12-17 07:35:43,322 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 07:35:43,325 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 07:35:43,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 07:35:43,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1615819957, now seen corresponding path program 1 times [2021-12-17 07:35:43,326 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 07:35:43,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [33912566] [2021-12-17 07:35:43,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 07:35:43,326 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 07:35:43,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 07:35:43,327 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) [2021-12-17 07:35:43,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-12-17 07:35:47,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 07:35:47,446 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-17 07:35:47,447 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 07:36:29,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 07:36:29,694 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 07:36:29,694 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 07:36:29,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [33912566] [2021-12-17 07:36:29,694 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [33912566] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 07:36:29,694 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 07:36:29,694 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-17 07:36:29,694 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715053637] [2021-12-17 07:36:29,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 07:36:29,695 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-17 07:36:29,695 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 07:36:29,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-17 07:36:29,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-17 07:36:29,695 INFO L87 Difference]: Start difference. First operand 52 states and 58 transitions. Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 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) [2021-12-17 07:36:41,533 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.62s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-17 07:36:44,504 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.97s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-17 07:36:46,016 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 07:36:48,933 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.66s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 07:36:51,807 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.87s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 07:36:54,657 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.85s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 07:36:57,557 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 [] [2021-12-17 07:36:59,995 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.44s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 07:37:02,002 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 07:37:04,007 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 07:37:06,058 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 07:37:08,061 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 07:37:08,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 07:37:08,487 INFO L93 Difference]: Finished difference Result 66 states and 73 transitions. [2021-12-17 07:37:08,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-17 07:37:08,489 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 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 32 [2021-12-17 07:37:08,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 07:37:08,489 INFO L225 Difference]: With dead ends: 66 [2021-12-17 07:37:08,489 INFO L226 Difference]: Without dead ends: 47 [2021-12-17 07:37:08,490 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2021-12-17 07:37:08,490 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 54 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 31.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 33.1s IncrementalHoareTripleChecker+Time [2021-12-17 07:37:08,490 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 163 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 11 Unknown, 0 Unchecked, 33.1s Time] [2021-12-17 07:37:08,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2021-12-17 07:37:08,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2021-12-17 07:37:08,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 42 states have (on average 1.1428571428571428) internal successors, (48), 42 states have internal predecessors, (48), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-17 07:37:08,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2021-12-17 07:37:08,493 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 32 [2021-12-17 07:37:08,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 07:37:08,493 INFO L470 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2021-12-17 07:37:08,493 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 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) [2021-12-17 07:37:08,493 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2021-12-17 07:37:08,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-12-17 07:37:08,493 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 07:37:08,494 INFO L514 BasicCegarLoop]: 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, 1, 1, 1, 1] [2021-12-17 07:37:08,597 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2021-12-17 07:37:08,694 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 07:37:08,694 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 07:37:08,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 07:37:08,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1350521666, now seen corresponding path program 1 times [2021-12-17 07:37:08,695 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 07:37:08,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1374163659] [2021-12-17 07:37:08,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 07:37:08,695 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 07:37:08,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 07:37:08,696 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) [2021-12-17 07:37:08,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2021-12-17 07:37:12,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 07:37:13,094 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-17 07:37:13,096 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 07:37:18,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 07:37:18,496 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 07:37:18,496 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 07:37:18,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1374163659] [2021-12-17 07:37:18,496 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1374163659] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 07:37:18,496 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 07:37:18,496 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-17 07:37:18,496 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835442893] [2021-12-17 07:37:18,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 07:37:18,497 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-17 07:37:18,497 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 07:37:18,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-17 07:37:18,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-17 07:37:18,497 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-17 07:37:19,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 07:37:19,868 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2021-12-17 07:37:19,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-17 07:37:19,868 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), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 39 [2021-12-17 07:37:19,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 07:37:19,868 INFO L225 Difference]: With dead ends: 47 [2021-12-17 07:37:19,868 INFO L226 Difference]: Without dead ends: 0 [2021-12-17 07:37:19,869 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-12-17 07:37:19,869 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 19 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 36 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-17 07:37:19,869 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 186 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 36 Unchecked, 0.3s Time] [2021-12-17 07:37:19,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-12-17 07:37:19,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-12-17 07:37:19,870 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) [2021-12-17 07:37:19,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-12-17 07:37:19,870 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 39 [2021-12-17 07:37:19,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 07:37:19,870 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-17 07:37:19,870 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-17 07:37:19,870 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-12-17 07:37:19,870 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-12-17 07:37:19,872 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-17 07:37:19,986 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2021-12-17 07:37:20,087 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 07:37:20,089 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-12-17 07:37:31,126 INFO L858 garLoopResultBuilder]: For program point L26(lines 26 31) no Hoare annotation was computed. [2021-12-17 07:37:31,126 INFO L858 garLoopResultBuilder]: For program point L26-1(lines 19 33) no Hoare annotation was computed. [2021-12-17 07:37:31,126 INFO L858 garLoopResultBuilder]: For program point fabs_doubleEXIT(lines 19 33) no Hoare annotation was computed. [2021-12-17 07:37:31,126 INFO L858 garLoopResultBuilder]: For program point L26-2(lines 26 31) no Hoare annotation was computed. [2021-12-17 07:37:31,126 INFO L861 garLoopResultBuilder]: At program point fabs_doubleENTRY(lines 19 33) the Hoare annotation is: true [2021-12-17 07:37:31,126 INFO L858 garLoopResultBuilder]: For program point L21-1(lines 21 25) no Hoare annotation was computed. [2021-12-17 07:37:31,127 INFO L861 garLoopResultBuilder]: At program point L21-2(lines 21 25) the Hoare annotation is: true [2021-12-17 07:37:31,127 INFO L858 garLoopResultBuilder]: For program point fabs_doubleFINAL(lines 19 33) no Hoare annotation was computed. [2021-12-17 07:37:31,127 INFO L854 garLoopResultBuilder]: At program point L97(line 97) the Hoare annotation is: (or (not (= ~huge_atan~0 ((_ to_fp 11 53) currentRoundingMode 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0))) (and (= atan_double_~x |atan_double_#in~x|) (exists ((|v_skolemized_q#valueAsBitvector_87| (_ BitVec 64))) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_87|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_87|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_87|)) |atan_double_#in~x|) (not (bvslt (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_87|)) (_ bv1071382528 32)))))) (not (= currentRoundingMode roundNearestTiesToEven)) (not (= ~one_atan~0 ((_ to_fp 11 53) currentRoundingMode 1.0)))) [2021-12-17 07:37:31,127 INFO L858 garLoopResultBuilder]: For program point L97-1(line 97) no Hoare annotation was computed. [2021-12-17 07:37:31,127 INFO L858 garLoopResultBuilder]: For program point L85(lines 85 88) no Hoare annotation was computed. [2021-12-17 07:37:31,127 INFO L858 garLoopResultBuilder]: For program point L98(lines 98 114) no Hoare annotation was computed. [2021-12-17 07:37:31,127 INFO L858 garLoopResultBuilder]: For program point L90(lines 90 115) no Hoare annotation was computed. [2021-12-17 07:37:31,127 INFO L858 garLoopResultBuilder]: For program point L78-1(lines 78 82) no Hoare annotation was computed. [2021-12-17 07:37:31,127 INFO L854 garLoopResultBuilder]: At program point L78-2(lines 78 82) the Hoare annotation is: (or (not (= ~huge_atan~0 ((_ to_fp 11 53) currentRoundingMode 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0))) (not (= ~one_atan~0 ((_ to_fp 11 53) currentRoundingMode 1.0))) (exists ((|v_skolemized_q#valueAsBitvector_57| (_ BitVec 64))) (and (bvsge (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_57|)) (_ bv1141899264 32)) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_57|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_57|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_57|)) |atan_double_#in~x|))) (not (= currentRoundingMode roundNearestTiesToEven))) [2021-12-17 07:37:31,128 INFO L858 garLoopResultBuilder]: For program point L78-3(lines 76 89) no Hoare annotation was computed. [2021-12-17 07:37:31,128 INFO L858 garLoopResultBuilder]: For program point L107(lines 107 113) no Hoare annotation was computed. [2021-12-17 07:37:31,128 INFO L858 garLoopResultBuilder]: For program point L107-2(lines 90 115) no Hoare annotation was computed. [2021-12-17 07:37:31,128 INFO L858 garLoopResultBuilder]: For program point L70-1(lines 70 74) no Hoare annotation was computed. [2021-12-17 07:37:31,128 INFO L854 garLoopResultBuilder]: At program point L70-2(lines 70 74) the Hoare annotation is: (or (not (= ~huge_atan~0 ((_ to_fp 11 53) currentRoundingMode 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0))) (= atan_double_~x |atan_double_#in~x|) (not (= currentRoundingMode roundNearestTiesToEven)) (not (= ~one_atan~0 ((_ to_fp 11 53) currentRoundingMode 1.0)))) [2021-12-17 07:37:31,128 INFO L858 garLoopResultBuilder]: For program point L132(line 132) no Hoare annotation was computed. [2021-12-17 07:37:31,128 INFO L858 garLoopResultBuilder]: For program point L70-3(lines 70 74) no Hoare annotation was computed. [2021-12-17 07:37:31,128 INFO L858 garLoopResultBuilder]: For program point L99(lines 99 105) no Hoare annotation was computed. [2021-12-17 07:37:31,128 INFO L858 garLoopResultBuilder]: For program point L132-2(line 132) no Hoare annotation was computed. [2021-12-17 07:37:31,129 INFO L858 garLoopResultBuilder]: For program point L128(lines 128 133) no Hoare annotation was computed. [2021-12-17 07:37:31,129 INFO L858 garLoopResultBuilder]: For program point L91(lines 91 94) no Hoare annotation was computed. [2021-12-17 07:37:31,129 INFO L858 garLoopResultBuilder]: For program point L91-2(lines 91 94) no Hoare annotation was computed. [2021-12-17 07:37:31,129 INFO L858 garLoopResultBuilder]: For program point atan_doubleEXIT(lines 66 134) no Hoare annotation was computed. [2021-12-17 07:37:31,129 INFO L858 garLoopResultBuilder]: For program point L92(lines 92 93) no Hoare annotation was computed. [2021-12-17 07:37:31,129 INFO L861 garLoopResultBuilder]: At program point atan_doubleENTRY(lines 66 134) the Hoare annotation is: true [2021-12-17 07:37:31,129 INFO L858 garLoopResultBuilder]: For program point L76(lines 76 89) no Hoare annotation was computed. [2021-12-17 07:37:31,129 INFO L858 garLoopResultBuilder]: For program point atan_doubleFINAL(lines 66 134) no Hoare annotation was computed. [2021-12-17 07:37:31,129 INFO L858 garLoopResultBuilder]: For program point L217(lines 217 220) no Hoare annotation was computed. [2021-12-17 07:37:31,129 INFO L858 garLoopResultBuilder]: For program point L217-2(lines 215 220) no Hoare annotation was computed. [2021-12-17 07:37:31,129 INFO L858 garLoopResultBuilder]: For program point L201(line 201) no Hoare annotation was computed. [2021-12-17 07:37:31,129 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-12-17 07:37:31,129 INFO L858 garLoopResultBuilder]: For program point L185(lines 185 209) no Hoare annotation was computed. [2021-12-17 07:37:31,129 INFO L858 garLoopResultBuilder]: For program point L185-1(lines 144 244) no Hoare annotation was computed. [2021-12-17 07:37:31,129 INFO L858 garLoopResultBuilder]: For program point L186(lines 186 208) no Hoare annotation was computed. [2021-12-17 07:37:31,129 INFO L858 garLoopResultBuilder]: For program point L269(lines 269 276) no Hoare annotation was computed. [2021-12-17 07:37:31,129 INFO L858 garLoopResultBuilder]: For program point L203(line 203) no Hoare annotation was computed. [2021-12-17 07:37:31,129 INFO L858 garLoopResultBuilder]: For program point L269-2(lines 269 276) no Hoare annotation was computed. [2021-12-17 07:37:31,129 INFO L858 garLoopResultBuilder]: For program point L170(lines 170 180) no Hoare annotation was computed. [2021-12-17 07:37:31,130 INFO L858 garLoopResultBuilder]: For program point L170-2(lines 144 244) no Hoare annotation was computed. [2021-12-17 07:37:31,130 INFO L854 garLoopResultBuilder]: At program point L220(line 220) the Hoare annotation is: false [2021-12-17 07:37:31,130 INFO L858 garLoopResultBuilder]: For program point L187(lines 187 196) no Hoare annotation was computed. [2021-12-17 07:37:31,130 INFO L854 garLoopResultBuilder]: At program point L220-1(line 220) the Hoare annotation is: false [2021-12-17 07:37:31,130 INFO L858 garLoopResultBuilder]: For program point L220-2(line 220) no Hoare annotation was computed. [2021-12-17 07:37:31,130 INFO L858 garLoopResultBuilder]: For program point L171(lines 171 179) no Hoare annotation was computed. [2021-12-17 07:37:31,130 INFO L858 garLoopResultBuilder]: For program point L221(lines 221 243) no Hoare annotation was computed. [2021-12-17 07:37:31,130 INFO L858 garLoopResultBuilder]: For program point L188(line 188) no Hoare annotation was computed. [2021-12-17 07:37:31,130 INFO L858 garLoopResultBuilder]: For program point L205(line 205) no Hoare annotation was computed. [2021-12-17 07:37:31,130 INFO L858 garLoopResultBuilder]: For program point L172(line 172) no Hoare annotation was computed. [2021-12-17 07:37:31,130 INFO L858 garLoopResultBuilder]: For program point L172-2(line 172) no Hoare annotation was computed. [2021-12-17 07:37:31,130 INFO L854 garLoopResultBuilder]: At program point L255(lines 246 256) the Hoare annotation is: (let ((.cse0 (fp.neg (_ +zero 11 53)))) (and (= |ULTIMATE.start___ieee754_atan2_~y#1| .cse0) |ULTIMATE.start_main_#t~short46#1| (= |ULTIMATE.start___signbit_double_#res#1| (_ bv1 32)) (= |ULTIMATE.start_main_~y~0#1| .cse0))) [2021-12-17 07:37:31,130 INFO L858 garLoopResultBuilder]: For program point L222(line 222) no Hoare annotation was computed. [2021-12-17 07:37:31,130 INFO L858 garLoopResultBuilder]: For program point L156-1(lines 156 161) no Hoare annotation was computed. [2021-12-17 07:37:31,130 INFO L854 garLoopResultBuilder]: At program point L156-2(lines 156 161) the Hoare annotation is: (let ((.cse0 (fp.neg (_ +zero 11 53)))) (and (= currentRoundingMode roundNearestTiesToEven) (= |ULTIMATE.start___ieee754_atan2_~y#1| .cse0) (exists ((|v_skolemized_q#valueAsBitvector_45| (_ BitVec 64)) (|v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_12| (_ BitVec 32))) (let ((.cse1 (select (select |#memory_int| |v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_12|) (_ bv4 32)))) (and (fp.gt (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_45|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_45|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_45|)) (_ +zero 11 53)) (= |ULTIMATE.start___ieee754_atan2_~hx~1#1| .cse1) (= .cse1 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_45|))))) (exists ((|v_skolemized_q#valueAsBitvector_25| (_ BitVec 64)) (|v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_6| (_ BitVec 32))) (let ((.cse4 (select |#memory_int| |v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_6|))) (let ((.cse2 (select .cse4 (_ bv4 32))) (.cse3 (select .cse4 (_ bv0 32)))) (and (= |ULTIMATE.start___ieee754_atan2_~ix~1#1| (bvand (_ bv2147483647 32) .cse2)) (= .cse2 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_25|)) (= |ULTIMATE.start___ieee754_atan2_~lx~0#1| .cse3) (fp.gt (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_25|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_25|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_25|)) (_ +zero 11 53)) (= .cse3 ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_25|)))))) (= ~huge_atan~0 ((_ to_fp 11 53) currentRoundingMode 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0)) (= |ULTIMATE.start_main_~y~0#1| .cse0) (= ~one_atan~0 ((_ to_fp 11 53) currentRoundingMode 1.0)))) [2021-12-17 07:37:31,130 INFO L858 garLoopResultBuilder]: For program point L156-3(lines 156 161) no Hoare annotation was computed. [2021-12-17 07:37:31,130 INFO L858 garLoopResultBuilder]: For program point L272(line 272) no Hoare annotation was computed. [2021-12-17 07:37:31,130 INFO L858 garLoopResultBuilder]: For program point L239(line 239) no Hoare annotation was computed. [2021-12-17 07:37:31,131 INFO L858 garLoopResultBuilder]: For program point L272-2(lines 272 275) no Hoare annotation was computed. [2021-12-17 07:37:31,131 INFO L858 garLoopResultBuilder]: For program point L173(line 173) no Hoare annotation was computed. [2021-12-17 07:37:31,131 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-12-17 07:37:31,131 INFO L858 garLoopResultBuilder]: For program point L190(line 190) no Hoare annotation was computed. [2021-12-17 07:37:31,131 INFO L858 garLoopResultBuilder]: For program point L273(line 273) no Hoare annotation was computed. [2021-12-17 07:37:31,131 INFO L858 garLoopResultBuilder]: For program point L224(line 224) no Hoare annotation was computed. [2021-12-17 07:37:31,131 INFO L858 garLoopResultBuilder]: For program point L241(line 241) no Hoare annotation was computed. [2021-12-17 07:37:31,131 INFO L858 garLoopResultBuilder]: For program point L175(line 175) no Hoare annotation was computed. [2021-12-17 07:37:31,131 INFO L858 garLoopResultBuilder]: For program point L192(line 192) no Hoare annotation was computed. [2021-12-17 07:37:31,131 INFO L858 garLoopResultBuilder]: For program point L226-1(lines 226 230) no Hoare annotation was computed. [2021-12-17 07:37:31,131 INFO L854 garLoopResultBuilder]: At program point L226-2(lines 226 230) the Hoare annotation is: false [2021-12-17 07:37:31,131 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-12-17 07:37:31,131 INFO L858 garLoopResultBuilder]: For program point L177(line 177) no Hoare annotation was computed. [2021-12-17 07:37:31,131 INFO L854 garLoopResultBuilder]: At program point L144(lines 144 244) the Hoare annotation is: (let ((.cse3 (fp.neg (_ +zero 11 53)))) (let ((.cse0 (= |ULTIMATE.start___ieee754_atan2_~y#1| .cse3)) (.cse2 (= |ULTIMATE.start___ieee754_atan2_#res#1| .cse3)) (.cse1 (= |ULTIMATE.start_main_~y~0#1| .cse3))) (or (and (= currentRoundingMode roundNearestTiesToEven) .cse0 (= ~huge_atan~0 ((_ to_fp 11 53) currentRoundingMode 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0)) .cse1 .cse2 (= ~one_atan~0 ((_ to_fp 11 53) currentRoundingMode 1.0))) (and .cse0 .cse2 .cse1 |ULTIMATE.start___ieee754_atan2_#t~switch32#1|)))) [2021-12-17 07:37:31,131 INFO L858 garLoopResultBuilder]: For program point L194(line 194) no Hoare annotation was computed. [2021-12-17 07:37:31,132 INFO L861 garLoopResultBuilder]: At program point L278(lines 258 279) the Hoare annotation is: true [2021-12-17 07:37:31,132 INFO L858 garLoopResultBuilder]: For program point L212(line 212) no Hoare annotation was computed. [2021-12-17 07:37:31,132 INFO L858 garLoopResultBuilder]: For program point L212-2(line 212) no Hoare annotation was computed. [2021-12-17 07:37:31,132 INFO L858 garLoopResultBuilder]: For program point L163(lines 163 165) no Hoare annotation was computed. [2021-12-17 07:37:31,132 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-12-17 07:37:31,132 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 273) no Hoare annotation was computed. [2021-12-17 07:37:31,132 INFO L858 garLoopResultBuilder]: For program point L231(lines 231 236) no Hoare annotation was computed. [2021-12-17 07:37:31,132 INFO L858 garLoopResultBuilder]: For program point L198(lines 198 207) no Hoare annotation was computed. [2021-12-17 07:37:31,132 INFO L858 garLoopResultBuilder]: For program point L231-1(lines 224 237) no Hoare annotation was computed. [2021-12-17 07:37:31,132 INFO L858 garLoopResultBuilder]: For program point L231-2(lines 231 236) no Hoare annotation was computed. [2021-12-17 07:37:31,132 INFO L858 garLoopResultBuilder]: For program point L215(lines 215 220) no Hoare annotation was computed. [2021-12-17 07:37:31,133 INFO L858 garLoopResultBuilder]: For program point L149-1(lines 149 154) no Hoare annotation was computed. [2021-12-17 07:37:31,133 INFO L854 garLoopResultBuilder]: At program point L149-2(lines 149 154) the Hoare annotation is: (let ((.cse0 (fp.neg (_ +zero 11 53)))) (and (= currentRoundingMode roundNearestTiesToEven) (fp.gt |ULTIMATE.start___ieee754_atan2_~x#1| (_ +zero 11 53)) (= |ULTIMATE.start___ieee754_atan2_~y#1| .cse0) (= ~huge_atan~0 ((_ to_fp 11 53) currentRoundingMode 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0)) (= |ULTIMATE.start_main_~y~0#1| .cse0) (= ~one_atan~0 ((_ to_fp 11 53) currentRoundingMode 1.0)))) [2021-12-17 07:37:31,133 INFO L858 garLoopResultBuilder]: For program point L149-3(lines 149 154) no Hoare annotation was computed. [2021-12-17 07:37:31,133 INFO L858 garLoopResultBuilder]: For program point L199(line 199) no Hoare annotation was computed. [2021-12-17 07:37:31,133 INFO L858 garLoopResultBuilder]: For program point L166(lines 166 167) no Hoare annotation was computed. [2021-12-17 07:37:31,133 INFO L858 garLoopResultBuilder]: For program point L249-1(lines 249 253) no Hoare annotation was computed. [2021-12-17 07:37:31,133 INFO L858 garLoopResultBuilder]: For program point L183(line 183) no Hoare annotation was computed. [2021-12-17 07:37:31,133 INFO L854 garLoopResultBuilder]: At program point L249-2(lines 249 253) the Hoare annotation is: (let ((.cse0 (fp.neg (_ +zero 11 53)))) (and (= |ULTIMATE.start___ieee754_atan2_~y#1| .cse0) (= |ULTIMATE.start_main_~res~0#1| .cse0) (= |ULTIMATE.start___signbit_double_~x#1| .cse0) |ULTIMATE.start_main_#t~short46#1| (= |ULTIMATE.start___ieee754_atan2_#res#1| .cse0) (= |ULTIMATE.start_main_~y~0#1| .cse0))) [2021-12-17 07:37:31,133 INFO L858 garLoopResultBuilder]: For program point L249-3(lines 249 253) no Hoare annotation was computed. [2021-12-17 07:37:31,133 INFO L858 garLoopResultBuilder]: For program point L183-2(line 183) no Hoare annotation was computed. [2021-12-17 07:37:31,133 INFO L854 garLoopResultBuilder]: At program point L167(line 167) the Hoare annotation is: (let ((.cse0 (fp.neg (_ +zero 11 53)))) (and (= currentRoundingMode roundNearestTiesToEven) (= |ULTIMATE.start___ieee754_atan2_~y#1| .cse0) (exists ((|v_skolemized_q#valueAsBitvector_38| (_ BitVec 64))) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_38|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_38|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_38|)) (fp.neg (_ +zero 11 53))) (= |ULTIMATE.start___ieee754_atan2_~hy~0#1| ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_38|)))) (= ~huge_atan~0 ((_ to_fp 11 53) currentRoundingMode 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0)) (exists ((|v_skolemized_q#valueAsBitvector_34| (_ BitVec 64))) (and (= (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|)) (fp.neg (_ +zero 11 53))) (= |ULTIMATE.start___ieee754_atan2_~ly~0#1| ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_34|)) (= |ULTIMATE.start___ieee754_atan2_~iy~0#1| (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_34|))))) (= |ULTIMATE.start_main_~y~0#1| .cse0) (= ~one_atan~0 ((_ to_fp 11 53) currentRoundingMode 1.0)))) [2021-12-17 07:37:31,133 INFO L858 garLoopResultBuilder]: For program point L167-1(line 167) no Hoare annotation was computed. [2021-12-17 07:37:31,136 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 07:37:31,137 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-17 07:37:31,148 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-12-17 07:37:31,149 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-12-17 07:37:31,150 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_57,QUANTIFIED] [2021-12-17 07:37:31,150 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_57,QUANTIFIED] [2021-12-17 07:37:31,150 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_57,QUANTIFIED] [2021-12-17 07:37:31,150 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_57,QUANTIFIED] [2021-12-17 07:37:31,150 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-12-17 07:37:31,150 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_57,QUANTIFIED] [2021-12-17 07:37:31,150 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_57,QUANTIFIED] [2021-12-17 07:37:31,151 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_57,QUANTIFIED] [2021-12-17 07:37:31,151 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_57,QUANTIFIED] [2021-12-17 07:37:31,151 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-12-17 07:37:31,151 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-12-17 07:37:31,152 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_45,QUANTIFIED] [2021-12-17 07:37:31,152 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_45,QUANTIFIED] [2021-12-17 07:37:31,152 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_45,QUANTIFIED] [2021-12-17 07:37:31,152 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_12,QUANTIFIED] [2021-12-17 07:37:31,152 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_12,QUANTIFIED] [2021-12-17 07:37:31,152 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_45,QUANTIFIED] [2021-12-17 07:37:31,152 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_6,QUANTIFIED] [2021-12-17 07:37:31,153 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_6,QUANTIFIED] [2021-12-17 07:37:31,153 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_25,QUANTIFIED] [2021-12-17 07:37:31,153 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_6,QUANTIFIED] [2021-12-17 07:37:31,153 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_25,QUANTIFIED] [2021-12-17 07:37:31,153 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_25,QUANTIFIED] [2021-12-17 07:37:31,153 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_25,QUANTIFIED] [2021-12-17 07:37:31,153 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_6,QUANTIFIED] [2021-12-17 07:37:31,154 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_25,QUANTIFIED] [2021-12-17 07:37:31,154 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-12-17 07:37:31,154 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_45,QUANTIFIED] [2021-12-17 07:37:31,154 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_45,QUANTIFIED] [2021-12-17 07:37:31,154 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_45,QUANTIFIED] [2021-12-17 07:37:31,155 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_12,QUANTIFIED] [2021-12-17 07:37:31,155 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_12,QUANTIFIED] [2021-12-17 07:37:31,155 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_45,QUANTIFIED] [2021-12-17 07:37:31,155 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_6,QUANTIFIED] [2021-12-17 07:37:31,155 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_6,QUANTIFIED] [2021-12-17 07:37:31,155 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_25,QUANTIFIED] [2021-12-17 07:37:31,156 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_6,QUANTIFIED] [2021-12-17 07:37:31,156 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_25,QUANTIFIED] [2021-12-17 07:37:31,156 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_25,QUANTIFIED] [2021-12-17 07:37:31,156 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_25,QUANTIFIED] [2021-12-17 07:37:31,156 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_6,QUANTIFIED] [2021-12-17 07:37:31,156 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_25,QUANTIFIED] [2021-12-17 07:37:31,157 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-12-17 07:37:31,157 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-12-17 07:37:31,158 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-12-17 07:37:31,158 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-12-17 07:37:31,159 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.12 07:37:31 BoogieIcfgContainer [2021-12-17 07:37:31,159 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-17 07:37:31,160 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-17 07:37:31,160 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-17 07:37:31,160 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-17 07:37:31,161 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 07:31:16" (3/4) ... [2021-12-17 07:37:31,163 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-12-17 07:37:31,167 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fabs_double [2021-12-17 07:37:31,167 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure atan_double [2021-12-17 07:37:31,172 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 33 nodes and edges [2021-12-17 07:37:31,172 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2021-12-17 07:37:31,173 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2021-12-17 07:37:31,173 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-12-17 07:37:31,188 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven && y == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && (\exists v_skolemized_q#valueAsBitvector_45 : bv64, v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_12 : bv32 :: (~fp.gt~DOUBLE(~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_45[63:63], v_skolemized_q#valueAsBitvector_45[62:52], v_skolemized_q#valueAsBitvector_45[51:0]), ~Pluszero~LONGDOUBLE()) && hx == unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_12][4bv32]) && unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_12][4bv32] == v_skolemized_q#valueAsBitvector_45[63:32])) && (\exists v_skolemized_q#valueAsBitvector_25 : bv64, v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_6 : bv32 :: (((ix == ~bvand32(2147483647bv32, unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_6][4bv32]) && unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_6][4bv32] == v_skolemized_q#valueAsBitvector_25[63:32]) && lx == unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_6][0bv32]) && ~fp.gt~DOUBLE(~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_25[63:63], v_skolemized_q#valueAsBitvector_25[62:52], v_skolemized_q#valueAsBitvector_25[51:0]), ~Pluszero~LONGDOUBLE())) && unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_6][0bv32] == v_skolemized_q#valueAsBitvector_25[31:0])) && huge_atan == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0E300)) && y == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && one_atan == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0) [2021-12-17 07:37:31,188 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven && y == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && huge_atan == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0E300)) && y == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && \result == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && one_atan == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0)) || (((y == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && \result == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && y == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && aux-switch (m) { case 0: case 1: return y; case 2: return pi + tiny_atan2; case 3: return -pi - tiny_atan2; }-aux) [2021-12-17 07:37:31,188 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((!(huge_atan == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0E300)) || x == \old(x)) || !(unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven)) || !(one_atan == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0)) [2021-12-17 07:37:31,189 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((y == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && res == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && aux-res == -0.0 && __signbit_double(res) == 1-aux) && \result == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && y == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) [2021-12-17 07:37:31,189 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((!(huge_atan == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0E300)) || !(one_atan == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0))) || (\exists v_skolemized_q#valueAsBitvector_57 : bv64 :: ~bvsge32(~bvand32(2147483647bv32, v_skolemized_q#valueAsBitvector_57[63:32]), 1141899264bv32) && ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_57[63:63], v_skolemized_q#valueAsBitvector_57[62:52], v_skolemized_q#valueAsBitvector_57[51:0]) == \old(x))) || !(unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) [2021-12-17 07:37:31,193 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((y == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && aux-res == -0.0 && __signbit_double(res) == 1-aux) && \result == 1bv32) && y == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) [2021-12-17 07:37:31,225 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-17 07:37:31,226 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-17 07:37:31,226 INFO L158 Benchmark]: Toolchain (without parser) took 399543.04ms. Allocated memory was 67.1MB in the beginning and 92.3MB in the end (delta: 25.2MB). Free memory was 46.6MB in the beginning and 25.5MB in the end (delta: 21.1MB). Peak memory consumption was 46.6MB. Max. memory is 16.1GB. [2021-12-17 07:37:31,229 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 67.1MB. Free memory was 47.3MB in the beginning and 47.2MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-17 07:37:31,230 INFO L158 Benchmark]: CACSL2BoogieTranslator took 346.63ms. Allocated memory is still 67.1MB. Free memory was 46.5MB in the beginning and 43.9MB in the end (delta: 2.6MB). Peak memory consumption was 11.2MB. Max. memory is 16.1GB. [2021-12-17 07:37:31,230 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.01ms. Allocated memory is still 67.1MB. Free memory was 43.9MB in the beginning and 41.2MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-17 07:37:31,231 INFO L158 Benchmark]: Boogie Preprocessor took 60.81ms. Allocated memory is still 67.1MB. Free memory was 41.2MB in the beginning and 38.5MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-17 07:37:31,231 INFO L158 Benchmark]: RCFGBuilder took 24810.37ms. Allocated memory is still 67.1MB. Free memory was 38.5MB in the beginning and 30.7MB in the end (delta: 7.8MB). Peak memory consumption was 13.5MB. Max. memory is 16.1GB. [2021-12-17 07:37:31,232 INFO L158 Benchmark]: TraceAbstraction took 374193.99ms. Allocated memory was 67.1MB in the beginning and 92.3MB in the end (delta: 25.2MB). Free memory was 30.3MB in the beginning and 33.9MB in the end (delta: -3.6MB). Peak memory consumption was 21.9MB. Max. memory is 16.1GB. [2021-12-17 07:37:31,232 INFO L158 Benchmark]: Witness Printer took 65.74ms. Allocated memory is still 92.3MB. Free memory was 33.9MB in the beginning and 25.5MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-17 07:37:31,233 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 67.1MB. Free memory was 47.3MB in the beginning and 47.2MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 346.63ms. Allocated memory is still 67.1MB. Free memory was 46.5MB in the beginning and 43.9MB in the end (delta: 2.6MB). Peak memory consumption was 11.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.01ms. Allocated memory is still 67.1MB. Free memory was 43.9MB in the beginning and 41.2MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 60.81ms. Allocated memory is still 67.1MB. Free memory was 41.2MB in the beginning and 38.5MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 24810.37ms. Allocated memory is still 67.1MB. Free memory was 38.5MB in the beginning and 30.7MB in the end (delta: 7.8MB). Peak memory consumption was 13.5MB. Max. memory is 16.1GB. * TraceAbstraction took 374193.99ms. Allocated memory was 67.1MB in the beginning and 92.3MB in the end (delta: 25.2MB). Free memory was 30.3MB in the beginning and 33.9MB in the end (delta: -3.6MB). Peak memory consumption was 21.9MB. Max. memory is 16.1GB. * Witness Printer took 65.74ms. Allocated memory is still 92.3MB. Free memory was 33.9MB in the beginning and 25.5MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - 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[v_skolemized_q#valueAsBitvector_57,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_57,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_57,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_57,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_57,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_57,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_57,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_57,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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_25,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_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_25,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 * 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: 273]: 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, 99 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 374.1s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 209.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 11.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 47 mSolverCounterUnknown, 709 SdHoareTripleChecker+Valid, 167.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 700 mSDsluCounter, 6143 SdHoareTripleChecker+Invalid, 156.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 273 IncrementalHoareTripleChecker+Unchecked, 4894 mSDsCounter, 41 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 383 IncrementalHoareTripleChecker+Invalid, 744 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 41 mSolverCounterUnsat, 1249 mSDtfsCounter, 383 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 391 GetRequests, 263 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 82.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=99occurred in iteration=0, InterpolantAutomatonStates: 121, 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, 15 MinimizatonAttempts, 55 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 16 LocationsWithAnnotation, 52 PreInvPairs, 66 NumberOfFragments, 352 HoareAnnotationTreeSize, 52 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 16 FomulaSimplificationsInter, 548 FormulaSimplificationTreeSizeReductionInter, 11.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 17.1s SatisfiabilityAnalysisTime, 132.8s InterpolantComputationTime, 360 NumberOfCodeBlocks, 360 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 345 ConstructedInterpolants, 67 QuantifiedInterpolants, 2972 SizeOfPredicates, 111 NumberOfNonLiveVariables, 2419 ConjunctsInSsa, 181 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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: 246]: Loop Invariant Derived loop invariant: ((y == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && aux-res == -0.0 && __signbit_double(res) == 1-aux) && \result == 1bv32) && y == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 149]: Loop Invariant [2021-12-17 07:37:31,246 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-12-17 07:37:31,246 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ((((unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven && ~fp.gt~DOUBLE(x, ~Pluszero~LONGDOUBLE())) && y == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && huge_atan == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0E300)) && y == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && one_atan == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0) - InvariantResult [Line: 78]: Loop Invariant [2021-12-17 07:37:31,247 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_57,QUANTIFIED] [2021-12-17 07:37:31,247 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_57,QUANTIFIED] [2021-12-17 07:37:31,247 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_57,QUANTIFIED] [2021-12-17 07:37:31,247 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_57,QUANTIFIED] [2021-12-17 07:37:31,247 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-12-17 07:37:31,247 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_57,QUANTIFIED] [2021-12-17 07:37:31,253 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_57,QUANTIFIED] [2021-12-17 07:37:31,253 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_57,QUANTIFIED] [2021-12-17 07:37:31,253 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_57,QUANTIFIED] [2021-12-17 07:37:31,253 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ((!(huge_atan == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0E300)) || !(one_atan == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0))) || (\exists v_skolemized_q#valueAsBitvector_57 : bv64 :: ~bvsge32(~bvand32(2147483647bv32, v_skolemized_q#valueAsBitvector_57[63:32]), 1141899264bv32) && ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_57[63:63], v_skolemized_q#valueAsBitvector_57[62:52], v_skolemized_q#valueAsBitvector_57[51:0]) == \old(x))) || !(unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) - InvariantResult [Line: 156]: Loop Invariant [2021-12-17 07:37:31,254 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-12-17 07:37:31,254 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_45,QUANTIFIED] [2021-12-17 07:37:31,254 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_45,QUANTIFIED] [2021-12-17 07:37:31,254 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_45,QUANTIFIED] [2021-12-17 07:37:31,255 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_12,QUANTIFIED] [2021-12-17 07:37:31,255 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_12,QUANTIFIED] [2021-12-17 07:37:31,255 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_45,QUANTIFIED] [2021-12-17 07:37:31,255 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_6,QUANTIFIED] [2021-12-17 07:37:31,255 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_6,QUANTIFIED] [2021-12-17 07:37:31,255 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_25,QUANTIFIED] [2021-12-17 07:37:31,255 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_6,QUANTIFIED] [2021-12-17 07:37:31,255 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_25,QUANTIFIED] [2021-12-17 07:37:31,256 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_25,QUANTIFIED] [2021-12-17 07:37:31,256 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_25,QUANTIFIED] [2021-12-17 07:37:31,256 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_6,QUANTIFIED] [2021-12-17 07:37:31,256 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_25,QUANTIFIED] [2021-12-17 07:37:31,257 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-12-17 07:37:31,257 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_45,QUANTIFIED] [2021-12-17 07:37:31,257 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_45,QUANTIFIED] [2021-12-17 07:37:31,257 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_45,QUANTIFIED] [2021-12-17 07:37:31,257 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_12,QUANTIFIED] [2021-12-17 07:37:31,257 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_12,QUANTIFIED] [2021-12-17 07:37:31,257 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_45,QUANTIFIED] [2021-12-17 07:37:31,257 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_6,QUANTIFIED] [2021-12-17 07:37:31,258 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_6,QUANTIFIED] [2021-12-17 07:37:31,258 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_25,QUANTIFIED] [2021-12-17 07:37:31,258 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_6,QUANTIFIED] [2021-12-17 07:37:31,258 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_25,QUANTIFIED] [2021-12-17 07:37:31,258 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_25,QUANTIFIED] [2021-12-17 07:37:31,258 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_25,QUANTIFIED] [2021-12-17 07:37:31,258 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_6,QUANTIFIED] [2021-12-17 07:37:31,258 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_25,QUANTIFIED] Derived loop invariant: (((((unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven && y == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && (\exists v_skolemized_q#valueAsBitvector_45 : bv64, v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_12 : bv32 :: (~fp.gt~DOUBLE(~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_45[63:63], v_skolemized_q#valueAsBitvector_45[62:52], v_skolemized_q#valueAsBitvector_45[51:0]), ~Pluszero~LONGDOUBLE()) && hx == unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_12][4bv32]) && unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_12][4bv32] == v_skolemized_q#valueAsBitvector_45[63:32])) && (\exists v_skolemized_q#valueAsBitvector_25 : bv64, v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_6 : bv32 :: (((ix == ~bvand32(2147483647bv32, unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_6][4bv32]) && unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_6][4bv32] == v_skolemized_q#valueAsBitvector_25[63:32]) && lx == unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_6][0bv32]) && ~fp.gt~DOUBLE(~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_25[63:63], v_skolemized_q#valueAsBitvector_25[62:52], v_skolemized_q#valueAsBitvector_25[51:0]), ~Pluszero~LONGDOUBLE())) && unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_6][0bv32] == v_skolemized_q#valueAsBitvector_25[31:0])) && huge_atan == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0E300)) && y == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && one_atan == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0) - InvariantResult [Line: 226]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 70]: Loop Invariant [2021-12-17 07:37:31,259 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-12-17 07:37:31,260 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ((!(huge_atan == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0E300)) || x == \old(x)) || !(unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven)) || !(one_atan == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0)) - InvariantResult [Line: 144]: Loop Invariant [2021-12-17 07:37:31,260 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-12-17 07:37:31,260 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: (((((unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven && y == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && huge_atan == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0E300)) && y == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && \result == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && one_atan == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0)) || (((y == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && \result == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && y == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && aux-switch (m) { case 0: case 1: return y; case 2: return pi + tiny_atan2; case 3: return -pi - tiny_atan2; }-aux) - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 258]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 249]: Loop Invariant Derived loop invariant: ((((y == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && res == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && aux-res == -0.0 && __signbit_double(res) == 1-aux) && \result == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && y == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) RESULT: Ultimate proved your program to be correct! [2021-12-17 07:37:31,487 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 [2021-12-17 07:37:31,589 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