./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/float_req_bl_0686b.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/float_req_bl_0686b.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 797a95f5d2ca1f6d76ea6fa52a391b975f9ddf1d0bb78f1805d7d4306e3b7f84 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 03:08:59,063 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 03:08:59,065 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 03:08:59,098 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 03:08:59,098 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 03:08:59,099 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 03:08:59,100 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 03:08:59,101 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 03:08:59,103 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 03:08:59,104 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 03:08:59,105 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 03:08:59,106 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 03:08:59,106 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 03:08:59,107 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 03:08:59,108 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 03:08:59,110 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 03:08:59,110 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 03:08:59,111 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 03:08:59,113 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 03:08:59,115 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 03:08:59,116 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 03:08:59,117 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 03:08:59,118 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 03:08:59,119 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 03:08:59,120 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 03:08:59,123 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 03:08:59,124 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 03:08:59,124 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 03:08:59,125 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 03:08:59,126 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 03:08:59,126 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 03:08:59,127 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 03:08:59,128 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 03:08:59,128 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 03:08:59,129 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 03:08:59,130 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 03:08:59,132 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 03:08:59,133 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 03:08:59,133 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 03:08:59,133 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 03:08:59,133 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 03:08:59,134 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 03:08:59,135 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-12 03:08:59,157 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 03:08:59,161 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 03:08:59,161 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 03:08:59,162 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 03:08:59,162 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 03:08:59,162 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 03:08:59,163 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 03:08:59,163 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 03:08:59,163 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 03:08:59,164 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 03:08:59,164 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 03:08:59,164 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 03:08:59,164 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 03:08:59,164 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 03:08:59,165 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 03:08:59,165 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 03:08:59,165 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 03:08:59,165 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 03:08:59,165 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 03:08:59,165 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 03:08:59,165 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 03:08:59,166 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 03:08:59,166 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 03:08:59,166 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 03:08:59,166 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 03:08:59,167 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 03:08:59,167 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 03:08:59,167 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 03:08:59,167 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 03:08:59,167 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 03:08:59,167 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 03:08:59,168 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 03:08:59,168 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 03:08:59,168 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 -> 797a95f5d2ca1f6d76ea6fa52a391b975f9ddf1d0bb78f1805d7d4306e3b7f84 [2022-07-12 03:08:59,402 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 03:08:59,426 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 03:08:59,429 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 03:08:59,431 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 03:08:59,431 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 03:08:59,432 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_0686b.c [2022-07-12 03:08:59,510 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1cf067b86/3fcca970449446958583770b9c28ebcb/FLAG30c5a8060 [2022-07-12 03:08:59,907 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 03:08:59,908 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_0686b.c [2022-07-12 03:08:59,913 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1cf067b86/3fcca970449446958583770b9c28ebcb/FLAG30c5a8060 [2022-07-12 03:09:00,316 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1cf067b86/3fcca970449446958583770b9c28ebcb [2022-07-12 03:09:00,318 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 03:09:00,320 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 03:09:00,321 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 03:09:00,321 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 03:09:00,324 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 03:09:00,324 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 03:09:00" (1/1) ... [2022-07-12 03:09:00,325 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c5d6c88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:09:00, skipping insertion in model container [2022-07-12 03:09:00,325 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 03:09:00" (1/1) ... [2022-07-12 03:09:00,330 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 03:09:00,357 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 03:09:00,522 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/float_req_bl_0686b.c[5269,5282] [2022-07-12 03:09:00,525 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 03:09:00,534 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 03:09:00,577 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/float_req_bl_0686b.c[5269,5282] [2022-07-12 03:09:00,578 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 03:09:00,590 INFO L208 MainTranslator]: Completed translation [2022-07-12 03:09:00,591 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:09:00 WrapperNode [2022-07-12 03:09:00,591 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 03:09:00,592 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 03:09:00,592 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 03:09:00,592 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 03:09:00,598 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:09:00" (1/1) ... [2022-07-12 03:09:00,607 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:09:00" (1/1) ... [2022-07-12 03:09:00,630 INFO L137 Inliner]: procedures = 19, calls = 79, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 252 [2022-07-12 03:09:00,631 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 03:09:00,631 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 03:09:00,632 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 03:09:00,632 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 03:09:00,638 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:09:00" (1/1) ... [2022-07-12 03:09:00,639 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:09:00" (1/1) ... [2022-07-12 03:09:00,656 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:09:00" (1/1) ... [2022-07-12 03:09:00,656 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:09:00" (1/1) ... [2022-07-12 03:09:00,665 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:09:00" (1/1) ... [2022-07-12 03:09:00,669 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:09:00" (1/1) ... [2022-07-12 03:09:00,672 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:09:00" (1/1) ... [2022-07-12 03:09:00,675 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 03:09:00,675 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 03:09:00,687 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 03:09:00,689 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 03:09:00,690 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:09:00" (1/1) ... [2022-07-12 03:09:00,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 03:09:00,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:09:00,720 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-12 03:09:00,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-12 03:09:00,744 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 03:09:00,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 03:09:00,745 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 03:09:00,745 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-07-12 03:09:00,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 03:09:00,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-07-12 03:09:00,745 INFO L130 BoogieDeclarations]: Found specification of procedure fabs_float [2022-07-12 03:09:00,745 INFO L138 BoogieDeclarations]: Found implementation of procedure fabs_float [2022-07-12 03:09:00,745 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 03:09:00,745 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 03:09:00,746 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 03:09:00,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2022-07-12 03:09:00,746 INFO L130 BoogieDeclarations]: Found specification of procedure atan_float [2022-07-12 03:09:00,746 INFO L138 BoogieDeclarations]: Found implementation of procedure atan_float [2022-07-12 03:09:00,746 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 03:09:00,821 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 03:09:00,822 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 03:09:01,174 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 03:09:01,180 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 03:09:01,183 INFO L299 CfgBuilder]: Removed 14 assume(true) statements. [2022-07-12 03:09:01,185 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:09:01 BoogieIcfgContainer [2022-07-12 03:09:01,185 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 03:09:01,187 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 03:09:01,188 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 03:09:01,190 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 03:09:01,190 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 03:09:00" (1/3) ... [2022-07-12 03:09:01,191 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77f1b9a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 03:09:01, skipping insertion in model container [2022-07-12 03:09:01,191 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:09:00" (2/3) ... [2022-07-12 03:09:01,191 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77f1b9a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 03:09:01, skipping insertion in model container [2022-07-12 03:09:01,191 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:09:01" (3/3) ... [2022-07-12 03:09:01,192 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_0686b.c [2022-07-12 03:09:01,203 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 03:09:01,203 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 03:09:01,238 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 03:09:01,243 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@23f16424, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@37a7e830 [2022-07-12 03:09:01,244 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 03:09:01,248 INFO L276 IsEmpty]: Start isEmpty. Operand has 103 states, 95 states have (on average 1.736842105263158) internal successors, (165), 96 states have internal predecessors, (165), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-12 03:09:01,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-12 03:09:01,254 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:09:01,254 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:09:01,255 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:09:01,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:09:01,259 INFO L85 PathProgramCache]: Analyzing trace with hash -817282921, now seen corresponding path program 1 times [2022-07-12 03:09:01,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:09:01,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654653271] [2022-07-12 03:09:01,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:09:01,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:09:01,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:09:01,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:09:01,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:09:01,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654653271] [2022-07-12 03:09:01,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654653271] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:09:01,416 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:09:01,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 03:09:01,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103418497] [2022-07-12 03:09:01,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:09:01,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-12 03:09:01,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:09:01,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-12 03:09:01,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 03:09:01,450 INFO L87 Difference]: Start difference. First operand has 103 states, 95 states have (on average 1.736842105263158) internal successors, (165), 96 states have internal predecessors, (165), 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 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:09:01,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:09:01,485 INFO L93 Difference]: Finished difference Result 204 states and 348 transitions. [2022-07-12 03:09:01,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-12 03:09:01,487 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-07-12 03:09:01,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:09:01,494 INFO L225 Difference]: With dead ends: 204 [2022-07-12 03:09:01,494 INFO L226 Difference]: Without dead ends: 100 [2022-07-12 03:09:01,500 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 03:09:01,504 INFO L413 NwaCegarLoop]: 152 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, 152 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:09:01,505 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:09:01,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-07-12 03:09:01,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2022-07-12 03:09:01,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 93 states have (on average 1.5161290322580645) internal successors, (141), 93 states have internal predecessors, (141), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-12 03:09:01,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 149 transitions. [2022-07-12 03:09:01,541 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 149 transitions. Word has length 10 [2022-07-12 03:09:01,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:09:01,541 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 149 transitions. [2022-07-12 03:09:01,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:09:01,542 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 149 transitions. [2022-07-12 03:09:01,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-12 03:09:01,542 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:09:01,542 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:09:01,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 03:09:01,543 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:09:01,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:09:01,543 INFO L85 PathProgramCache]: Analyzing trace with hash -2028269105, now seen corresponding path program 1 times [2022-07-12 03:09:01,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:09:01,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349852027] [2022-07-12 03:09:01,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:09:01,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:09:01,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:09:01,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:09:01,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:09:01,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349852027] [2022-07-12 03:09:01,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349852027] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:09:01,635 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:09:01,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 03:09:01,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603926600] [2022-07-12 03:09:01,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:09:01,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 03:09:01,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:09:01,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 03:09:01,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:09:01,638 INFO L87 Difference]: Start difference. First operand 100 states and 149 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:09:01,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:09:01,721 INFO L93 Difference]: Finished difference Result 213 states and 318 transitions. [2022-07-12 03:09:01,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 03:09:01,721 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-12 03:09:01,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:09:01,725 INFO L225 Difference]: With dead ends: 213 [2022-07-12 03:09:01,725 INFO L226 Difference]: Without dead ends: 142 [2022-07-12 03:09:01,726 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:09:01,727 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 57 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:09:01,727 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 418 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 03:09:01,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2022-07-12 03:09:01,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 127. [2022-07-12 03:09:01,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 120 states have (on average 1.55) internal successors, (186), 120 states have internal predecessors, (186), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-12 03:09:01,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 194 transitions. [2022-07-12 03:09:01,751 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 194 transitions. Word has length 12 [2022-07-12 03:09:01,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:09:01,752 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 194 transitions. [2022-07-12 03:09:01,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:09:01,752 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 194 transitions. [2022-07-12 03:09:01,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-12 03:09:01,753 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:09:01,753 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:09:01,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 03:09:01,753 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:09:01,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:09:01,754 INFO L85 PathProgramCache]: Analyzing trace with hash -595584804, now seen corresponding path program 1 times [2022-07-12 03:09:01,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:09:01,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114667784] [2022-07-12 03:09:01,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:09:01,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:09:01,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 03:09:01,800 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-12 03:09:01,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 03:09:01,856 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-12 03:09:01,856 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-12 03:09:01,857 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-12 03:09:01,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 03:09:01,864 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-07-12 03:09:01,867 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-12 03:09:01,912 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.07 03:09:01 BoogieIcfgContainer [2022-07-12 03:09:01,912 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-12 03:09:01,913 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-12 03:09:01,913 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-12 03:09:01,913 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-12 03:09:01,914 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:09:01" (3/4) ... [2022-07-12 03:09:01,916 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-12 03:09:01,916 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-12 03:09:01,917 INFO L158 Benchmark]: Toolchain (without parser) took 1596.94ms. Allocated memory was 96.5MB in the beginning and 123.7MB in the end (delta: 27.3MB). Free memory was 63.5MB in the beginning and 80.4MB in the end (delta: -16.9MB). Peak memory consumption was 10.6MB. Max. memory is 16.1GB. [2022-07-12 03:09:01,918 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 96.5MB. Free memory was 51.0MB in the beginning and 50.9MB in the end (delta: 38.2kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 03:09:01,920 INFO L158 Benchmark]: CACSL2BoogieTranslator took 269.86ms. Allocated memory is still 96.5MB. Free memory was 63.4MB in the beginning and 68.5MB in the end (delta: -5.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-12 03:09:01,920 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.16ms. Allocated memory is still 96.5MB. Free memory was 68.5MB in the beginning and 65.8MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 03:09:01,923 INFO L158 Benchmark]: Boogie Preprocessor took 43.40ms. Allocated memory is still 96.5MB. Free memory was 65.8MB in the beginning and 63.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 03:09:01,925 INFO L158 Benchmark]: RCFGBuilder took 510.16ms. Allocated memory was 96.5MB in the beginning and 123.7MB in the end (delta: 27.3MB). Free memory was 63.3MB in the beginning and 93.6MB in the end (delta: -30.3MB). Peak memory consumption was 24.5MB. Max. memory is 16.1GB. [2022-07-12 03:09:01,925 INFO L158 Benchmark]: TraceAbstraction took 724.89ms. Allocated memory is still 123.7MB. Free memory was 92.6MB in the beginning and 81.4MB in the end (delta: 11.3MB). Peak memory consumption was 9.7MB. Max. memory is 16.1GB. [2022-07-12 03:09:01,925 INFO L158 Benchmark]: Witness Printer took 3.12ms. Allocated memory is still 123.7MB. Free memory is still 80.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 03:09:01,927 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.21ms. Allocated memory is still 96.5MB. Free memory was 51.0MB in the beginning and 50.9MB in the end (delta: 38.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 269.86ms. Allocated memory is still 96.5MB. Free memory was 63.4MB in the beginning and 68.5MB in the end (delta: -5.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.16ms. Allocated memory is still 96.5MB. Free memory was 68.5MB in the beginning and 65.8MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.40ms. Allocated memory is still 96.5MB. Free memory was 65.8MB in the beginning and 63.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 510.16ms. Allocated memory was 96.5MB in the beginning and 123.7MB in the end (delta: 27.3MB). Free memory was 63.3MB in the beginning and 93.6MB in the end (delta: -30.3MB). Peak memory consumption was 24.5MB. Max. memory is 16.1GB. * TraceAbstraction took 724.89ms. Allocated memory is still 123.7MB. Free memory was 92.6MB in the beginning and 81.4MB in the end (delta: 11.3MB). Peak memory consumption was 9.7MB. Max. memory is 16.1GB. * Witness Printer took 3.12ms. Allocated memory is still 123.7MB. Free memory is still 80.4MB. 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: 231]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 230, overapproximation of someUnaryDOUBLEoperation at line 44, overapproximation of someBinaryArithmeticFLOAToperation at line 137. Possible FailurePath: [L29-L34] static const float atanhi_atan[] = { 4.6364760399e-01, 7.8539812565e-01, 9.8279368877e-01, 1.5707962513e+00, }; [L36-L41] static const float atanlo_atan[] = { 5.0121582440e-09, 3.7748947079e-08, 3.4473217170e-08, 7.5497894159e-08, }; [L43-L47] static const float aT_atan[] = { 3.3333334327e-01, -2.0000000298e-01, 1.4285714924e-01, -1.1111110449e-01, 9.0908870101e-02, -7.6918758452e-02, 6.6610731184e-02, -5.8335702866e-02, 4.9768779427e-02, -3.6531571299e-02, 1.6285819933e-02, }; [L49-L51] static const float one_atan = 1.0, huge_atan = 1.0e30, pi_o_4 = 7.8539818525e-01, pi_o_2 = 1.5707963705e+00, pi = 3.1415927410e+00; [L117-L118] static const float tiny_atan2 = 1.0e-30, zero_atan2 = 0.0, pi_lo_atan2 = -8.7422776573e-08; VAL [aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, zero_atan2=0] [L224] float x = 1.0f / 0.0f; [L225] float y = -1.0f / 0.0f; [L227] CALL, EXPR __ieee754_atan2f(y, x) [L121] float z; [L122] __int32_t k, m, hx, hy, ix, iy; VAL [\old(x)=1000000000000000000000000000003, \old(y)=1000000000000000000000000000001, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, x=1000000000000000000000000000003, y=1000000000000000000000000000001, zero_atan2=0] [L125] ieee_float_shape_type gf_u; [L126] gf_u.value = (x) [L127] EXPR gf_u.word [L127] (hx) = gf_u.word [L129] ix = hx & 0x7fffffff VAL [\old(x)=1000000000000000000000000000003, \old(y)=1000000000000000000000000000001, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000, hx=0, ix=0, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, x=1000000000000000000000000000003, y=1000000000000000000000000000001, zero_atan2=0] [L131] ieee_float_shape_type gf_u; [L132] gf_u.value = (y) [L133] EXPR gf_u.word [L133] (hy) = gf_u.word [L135] iy = hy & 0x7fffffff VAL [\old(x)=1000000000000000000000000000003, \old(y)=1000000000000000000000000000001, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000, hx=0, hy=2147483647, ix=0, iy=2147483646, iy = hy & 0x7fffffff=2147483647, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, x=1000000000000000000000000000003, y=1000000000000000000000000000001, zero_atan2=0] [L136] COND TRUE ((ix) > 0x7f800000L) || ((iy) > 0x7f800000L) [L137] return x + y; VAL [\old(x)=1000000000000000000000000000003, \old(y)=1000000000000000000000000000001, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000, hx=0, hy=2147483647, ix=0, iy=2147483646, iy = hy & 0x7fffffff=2147483647, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, x=1000000000000000000000000000003, y=1000000000000000000000000000001, zero_atan2=0] [L227] RET, EXPR __ieee754_atan2f(y, x) [L227] float res = __ieee754_atan2f(y, x); [L230] COND TRUE res != -pi_o_4 VAL [aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000, iy = hy & 0x7fffffff=2147483647, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, res=1000000000000000000000000000002, tiny_atan2=1/1000000000000000000000000000000, x=1000000000000000000000000000003, y=1000000000000000000000000000001, zero_atan2=0] [L231] reach_error() VAL [aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000, iy = hy & 0x7fffffff=2147483647, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, res=1000000000000000000000000000002, tiny_atan2=1/1000000000000000000000000000000, x=1000000000000000000000000000003, y=1000000000000000000000000000001, zero_atan2=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 103 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.6s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 59 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 57 mSDsluCounter, 570 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 265 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 34 IncrementalHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 305 mSDtfsCounter, 34 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=127occurred in iteration=2, InterpolantAutomatonStates: 6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 15 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 37 NumberOfCodeBlocks, 37 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 20 ConstructedInterpolants, 0 QuantifiedInterpolants, 32 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-07-12 03:09:01,967 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/float_req_bl_0686b.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 797a95f5d2ca1f6d76ea6fa52a391b975f9ddf1d0bb78f1805d7d4306e3b7f84 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 03:09:03,777 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 03:09:03,779 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 03:09:03,822 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 03:09:03,824 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 03:09:03,826 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 03:09:03,831 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 03:09:03,833 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 03:09:03,834 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 03:09:03,835 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 03:09:03,836 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 03:09:03,837 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 03:09:03,843 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 03:09:03,846 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 03:09:03,847 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 03:09:03,849 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 03:09:03,850 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 03:09:03,854 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 03:09:03,856 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 03:09:03,857 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 03:09:03,861 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 03:09:03,862 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 03:09:03,862 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 03:09:03,863 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 03:09:03,864 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 03:09:03,866 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 03:09:03,871 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 03:09:03,872 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 03:09:03,873 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 03:09:03,873 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 03:09:03,874 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 03:09:03,874 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 03:09:03,874 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 03:09:03,875 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 03:09:03,876 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 03:09:03,876 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 03:09:03,877 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 03:09:03,877 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 03:09:03,877 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 03:09:03,877 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 03:09:03,878 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 03:09:03,880 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 03:09:03,881 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-12 03:09:03,927 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 03:09:03,928 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 03:09:03,928 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 03:09:03,928 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 03:09:03,929 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 03:09:03,929 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 03:09:03,930 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 03:09:03,930 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 03:09:03,930 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 03:09:03,931 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 03:09:03,931 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 03:09:03,931 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 03:09:03,931 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 03:09:03,931 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 03:09:03,931 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 03:09:03,932 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 03:09:03,932 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-12 03:09:03,932 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-12 03:09:03,932 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-12 03:09:03,932 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 03:09:03,932 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 03:09:03,933 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 03:09:03,933 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 03:09:03,933 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 03:09:03,933 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 03:09:03,933 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 03:09:03,934 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 03:09:03,934 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 03:09:03,934 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 03:09:03,934 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 03:09:03,934 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-12 03:09:03,934 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-12 03:09:03,935 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 03:09:03,935 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 03:09:03,935 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 03:09:03,935 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-12 03:09:03,935 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 -> 797a95f5d2ca1f6d76ea6fa52a391b975f9ddf1d0bb78f1805d7d4306e3b7f84 [2022-07-12 03:09:04,239 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 03:09:04,256 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 03:09:04,258 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 03:09:04,259 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 03:09:04,260 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 03:09:04,262 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_0686b.c [2022-07-12 03:09:04,316 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e257941e/b2f180e8f78d4ed2a56b75eebeee50ae/FLAGac41090a6 [2022-07-12 03:09:04,709 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 03:09:04,710 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_0686b.c [2022-07-12 03:09:04,730 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e257941e/b2f180e8f78d4ed2a56b75eebeee50ae/FLAGac41090a6 [2022-07-12 03:09:05,117 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e257941e/b2f180e8f78d4ed2a56b75eebeee50ae [2022-07-12 03:09:05,119 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 03:09:05,120 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 03:09:05,121 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 03:09:05,121 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 03:09:05,124 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 03:09:05,124 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 03:09:05" (1/1) ... [2022-07-12 03:09:05,125 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@558d5e1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:09:05, skipping insertion in model container [2022-07-12 03:09:05,126 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 03:09:05" (1/1) ... [2022-07-12 03:09:05,131 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 03:09:05,164 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 03:09:05,312 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/float_req_bl_0686b.c[5269,5282] [2022-07-12 03:09:05,314 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 03:09:05,352 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 03:09:05,422 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/float_req_bl_0686b.c[5269,5282] [2022-07-12 03:09:05,423 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 03:09:05,439 INFO L208 MainTranslator]: Completed translation [2022-07-12 03:09:05,447 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:09:05 WrapperNode [2022-07-12 03:09:05,447 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 03:09:05,449 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 03:09:05,449 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 03:09:05,449 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 03:09:05,454 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:09:05" (1/1) ... [2022-07-12 03:09:05,478 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:09:05" (1/1) ... [2022-07-12 03:09:05,511 INFO L137 Inliner]: procedures = 22, calls = 79, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 217 [2022-07-12 03:09:05,512 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 03:09:05,513 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 03:09:05,513 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 03:09:05,513 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 03:09:05,519 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:09:05" (1/1) ... [2022-07-12 03:09:05,519 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:09:05" (1/1) ... [2022-07-12 03:09:05,534 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:09:05" (1/1) ... [2022-07-12 03:09:05,539 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:09:05" (1/1) ... [2022-07-12 03:09:05,549 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:09:05" (1/1) ... [2022-07-12 03:09:05,553 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:09:05" (1/1) ... [2022-07-12 03:09:05,555 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:09:05" (1/1) ... [2022-07-12 03:09:05,558 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 03:09:05,559 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 03:09:05,559 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 03:09:05,559 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 03:09:05,559 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:09:05" (1/1) ... [2022-07-12 03:09:05,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 03:09:05,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:09:05,597 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-12 03:09:05,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-12 03:09:05,646 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 03:09:05,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4 [2022-07-12 03:09:05,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-12 03:09:05,648 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 03:09:05,648 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2022-07-12 03:09:05,648 INFO L130 BoogieDeclarations]: Found specification of procedure fabs_float [2022-07-12 03:09:05,649 INFO L138 BoogieDeclarations]: Found implementation of procedure fabs_float [2022-07-12 03:09:05,649 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-12 03:09:05,649 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 03:09:05,649 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 03:09:05,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2022-07-12 03:09:05,649 INFO L130 BoogieDeclarations]: Found specification of procedure atan_float [2022-07-12 03:09:05,649 INFO L138 BoogieDeclarations]: Found implementation of procedure atan_float [2022-07-12 03:09:05,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-12 03:09:05,650 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 03:09:05,772 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 03:09:05,774 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 03:09:18,060 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 03:09:18,065 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 03:09:18,066 INFO L299 CfgBuilder]: Removed 14 assume(true) statements. [2022-07-12 03:09:18,067 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:09:18 BoogieIcfgContainer [2022-07-12 03:09:18,067 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 03:09:18,069 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 03:09:18,069 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 03:09:18,071 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 03:09:18,071 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 03:09:05" (1/3) ... [2022-07-12 03:09:18,071 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6656dab6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 03:09:18, skipping insertion in model container [2022-07-12 03:09:18,072 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:09:05" (2/3) ... [2022-07-12 03:09:18,072 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6656dab6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 03:09:18, skipping insertion in model container [2022-07-12 03:09:18,072 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:09:18" (3/3) ... [2022-07-12 03:09:18,073 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_0686b.c [2022-07-12 03:09:18,082 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 03:09:18,082 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 03:09:18,113 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 03:09:18,125 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@a218e89, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@139f1bcc [2022-07-12 03:09:18,125 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 03:09:18,129 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 82 states have (on average 1.6585365853658536) internal successors, (136), 83 states have internal predecessors, (136), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-12 03:09:18,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-12 03:09:18,133 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:09:18,134 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:09:18,148 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:09:18,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:09:18,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1138107774, now seen corresponding path program 1 times [2022-07-12 03:09:18,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:09:18,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1744784234] [2022-07-12 03:09:18,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:09:18,164 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:09:18,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:09:18,166 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 03:09:18,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-12 03:09:18,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:09:18,953 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-12 03:09:18,956 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:09:18,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:09:18,970 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:09:18,970 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:09:18,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1744784234] [2022-07-12 03:09:18,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1744784234] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:09:18,971 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:09:18,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 03:09:18,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806780101] [2022-07-12 03:09:18,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:09:18,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-12 03:09:18,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:09:18,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-12 03:09:18,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 03:09:18,997 INFO L87 Difference]: Start difference. First operand has 90 states, 82 states have (on average 1.6585365853658536) internal successors, (136), 83 states have internal predecessors, (136), 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 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:09:19,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:09:19,018 INFO L93 Difference]: Finished difference Result 178 states and 290 transitions. [2022-07-12 03:09:19,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-12 03:09:19,019 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-07-12 03:09:19,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:09:19,025 INFO L225 Difference]: With dead ends: 178 [2022-07-12 03:09:19,026 INFO L226 Difference]: Without dead ends: 87 [2022-07-12 03:09:19,032 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 03:09:19,036 INFO L413 NwaCegarLoop]: 129 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, 129 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:09:19,038 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:09:19,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-07-12 03:09:19,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2022-07-12 03:09:19,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 80 states have (on average 1.475) internal successors, (118), 80 states have internal predecessors, (118), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-12 03:09:19,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 126 transitions. [2022-07-12 03:09:19,074 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 126 transitions. Word has length 10 [2022-07-12 03:09:19,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:09:19,075 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 126 transitions. [2022-07-12 03:09:19,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:09:19,075 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 126 transitions. [2022-07-12 03:09:19,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-12 03:09:19,076 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:09:19,076 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:09:19,114 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-12 03:09:19,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 03:09:19,279 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:09:19,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:09:19,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1466192473, now seen corresponding path program 1 times [2022-07-12 03:09:19,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:09:19,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1003563017] [2022-07-12 03:09:19,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:09:19,281 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:09:19,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:09:19,282 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 03:09:19,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-12 03:09:20,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:09:20,110 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-12 03:09:20,114 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:09:20,317 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 03:09:20,745 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 20 [2022-07-12 03:09:21,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:09:21,318 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:09:21,319 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:09:21,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1003563017] [2022-07-12 03:09:21,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1003563017] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:09:21,324 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:09:21,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 03:09:21,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761011007] [2022-07-12 03:09:21,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:09:21,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 03:09:21,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:09:21,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 03:09:21,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 03:09:21,331 INFO L87 Difference]: Start difference. First operand 87 states and 126 transitions. Second operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:09:21,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:09:21,354 INFO L93 Difference]: Finished difference Result 91 states and 129 transitions. [2022-07-12 03:09:21,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 03:09:21,355 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-12 03:09:21,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:09:21,356 INFO L225 Difference]: With dead ends: 91 [2022-07-12 03:09:21,356 INFO L226 Difference]: Without dead ends: 87 [2022-07-12 03:09:21,357 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 03:09:21,358 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 0 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 67 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:09:21,358 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 655 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 67 Unchecked, 0.0s Time] [2022-07-12 03:09:21,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-07-12 03:09:21,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2022-07-12 03:09:21,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 80 states have (on average 1.4625) internal successors, (117), 80 states have internal predecessors, (117), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-12 03:09:21,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 125 transitions. [2022-07-12 03:09:21,369 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 125 transitions. Word has length 12 [2022-07-12 03:09:21,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:09:21,369 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 125 transitions. [2022-07-12 03:09:21,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:09:21,369 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 125 transitions. [2022-07-12 03:09:21,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-12 03:09:21,370 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:09:21,370 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:09:21,400 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-07-12 03:09:21,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 03:09:21,571 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:09:21,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:09:21,572 INFO L85 PathProgramCache]: Analyzing trace with hash -369945613, now seen corresponding path program 1 times [2022-07-12 03:09:21,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:09:21,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1803646086] [2022-07-12 03:09:21,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:09:21,573 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:09:21,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:09:21,574 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 03:09:21,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-12 03:09:22,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:09:22,394 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-12 03:09:22,395 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:09:22,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:09:22,919 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:09:22,920 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:09:22,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1803646086] [2022-07-12 03:09:22,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1803646086] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:09:22,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:09:22,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 03:09:22,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688445156] [2022-07-12 03:09:22,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:09:22,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 03:09:22,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:09:22,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 03:09:22,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 03:09:22,922 INFO L87 Difference]: Start difference. First operand 87 states and 125 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:09:22,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:09:22,945 INFO L93 Difference]: Finished difference Result 159 states and 227 transitions. [2022-07-12 03:09:22,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 03:09:22,945 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-07-12 03:09:22,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:09:22,946 INFO L225 Difference]: With dead ends: 159 [2022-07-12 03:09:22,946 INFO L226 Difference]: Without dead ends: 85 [2022-07-12 03:09:22,947 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 03:09:22,948 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 5 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 17 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:09:22,948 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 427 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 17 Unchecked, 0.0s Time] [2022-07-12 03:09:22,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-07-12 03:09:22,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 81. [2022-07-12 03:09:22,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 74 states have (on average 1.4324324324324325) internal successors, (106), 74 states have internal predecessors, (106), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-12 03:09:22,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 114 transitions. [2022-07-12 03:09:22,955 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 114 transitions. Word has length 17 [2022-07-12 03:09:22,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:09:22,955 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 114 transitions. [2022-07-12 03:09:22,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:09:22,956 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 114 transitions. [2022-07-12 03:09:22,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-12 03:09:22,956 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:09:22,956 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:09:22,988 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-12 03:09:23,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 03:09:23,157 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:09:23,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:09:23,158 INFO L85 PathProgramCache]: Analyzing trace with hash 2028116593, now seen corresponding path program 1 times [2022-07-12 03:09:23,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:09:23,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1664151615] [2022-07-12 03:09:23,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:09:23,159 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:09:23,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:09:23,163 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 03:09:23,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-12 03:09:23,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:09:24,026 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-12 03:09:24,034 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:09:24,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:09:24,638 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:09:24,638 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:09:24,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1664151615] [2022-07-12 03:09:24,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1664151615] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:09:24,639 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:09:24,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 03:09:24,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730159727] [2022-07-12 03:09:24,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:09:24,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 03:09:24,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:09:24,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 03:09:24,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 03:09:24,640 INFO L87 Difference]: Start difference. First operand 81 states and 114 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:09:24,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:09:24,646 INFO L93 Difference]: Finished difference Result 89 states and 120 transitions. [2022-07-12 03:09:24,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 03:09:24,646 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-07-12 03:09:24,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:09:24,648 INFO L225 Difference]: With dead ends: 89 [2022-07-12 03:09:24,648 INFO L226 Difference]: Without dead ends: 83 [2022-07-12 03:09:24,648 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 03:09:24,649 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 5 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 14 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:09:24,649 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 413 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 14 Unchecked, 0.0s Time] [2022-07-12 03:09:24,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-07-12 03:09:24,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 79. [2022-07-12 03:09:24,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 72 states have (on average 1.4166666666666667) internal successors, (102), 72 states have internal predecessors, (102), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-12 03:09:24,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 110 transitions. [2022-07-12 03:09:24,656 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 110 transitions. Word has length 17 [2022-07-12 03:09:24,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:09:24,657 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 110 transitions. [2022-07-12 03:09:24,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:09:24,657 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 110 transitions. [2022-07-12 03:09:24,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-12 03:09:24,658 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:09:24,658 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:09:24,703 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2022-07-12 03:09:24,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 03:09:24,872 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:09:24,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:09:24,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1893883166, now seen corresponding path program 1 times [2022-07-12 03:09:24,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:09:24,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2008952042] [2022-07-12 03:09:24,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:09:24,873 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:09:24,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:09:24,877 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 03:09:24,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-12 03:09:25,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:09:25,688 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-12 03:09:25,690 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:09:26,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:09:26,484 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:09:26,484 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:09:26,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2008952042] [2022-07-12 03:09:26,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2008952042] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:09:26,485 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:09:26,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 03:09:26,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142939900] [2022-07-12 03:09:26,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:09:26,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 03:09:26,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:09:26,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 03:09:26,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 03:09:26,486 INFO L87 Difference]: Start difference. First operand 79 states and 110 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:09:27,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:09:27,388 INFO L93 Difference]: Finished difference Result 100 states and 134 transitions. [2022-07-12 03:09:27,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 03:09:27,389 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-07-12 03:09:27,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:09:27,389 INFO L225 Difference]: With dead ends: 100 [2022-07-12 03:09:27,389 INFO L226 Difference]: Without dead ends: 96 [2022-07-12 03:09:27,390 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 03:09:27,390 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 19 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 25 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-12 03:09:27,391 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 508 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 25 Unchecked, 0.9s Time] [2022-07-12 03:09:27,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-07-12 03:09:27,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 79. [2022-07-12 03:09:27,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 72 states have (on average 1.4027777777777777) internal successors, (101), 72 states have internal predecessors, (101), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-12 03:09:27,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 109 transitions. [2022-07-12 03:09:27,399 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 109 transitions. Word has length 18 [2022-07-12 03:09:27,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:09:27,399 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 109 transitions. [2022-07-12 03:09:27,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:09:27,400 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 109 transitions. [2022-07-12 03:09:27,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-12 03:09:27,400 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:09:27,400 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:09:27,437 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-12 03:09:27,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 03:09:27,615 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:09:27,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:09:27,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1871003678, now seen corresponding path program 1 times [2022-07-12 03:09:27,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:09:27,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [348601496] [2022-07-12 03:09:27,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:09:27,616 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:09:27,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:09:27,618 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 03:09:27,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-12 03:09:28,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:09:28,461 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-12 03:09:28,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:09:29,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:09:29,038 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:09:29,038 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:09:29,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [348601496] [2022-07-12 03:09:29,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [348601496] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:09:29,038 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:09:29,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 03:09:29,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815755297] [2022-07-12 03:09:29,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:09:29,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 03:09:29,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:09:29,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 03:09:29,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 03:09:29,039 INFO L87 Difference]: Start difference. First operand 79 states and 109 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:09:29,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:09:29,044 INFO L93 Difference]: Finished difference Result 137 states and 186 transitions. [2022-07-12 03:09:29,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 03:09:29,044 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-07-12 03:09:29,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:09:29,045 INFO L225 Difference]: With dead ends: 137 [2022-07-12 03:09:29,045 INFO L226 Difference]: Without dead ends: 79 [2022-07-12 03:09:29,045 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 03:09:29,046 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 6 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 14 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:09:29,046 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 358 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 14 Unchecked, 0.0s Time] [2022-07-12 03:09:29,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-07-12 03:09:29,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 74. [2022-07-12 03:09:29,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 67 states have (on average 1.3582089552238805) internal successors, (91), 67 states have internal predecessors, (91), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-12 03:09:29,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 99 transitions. [2022-07-12 03:09:29,051 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 99 transitions. Word has length 18 [2022-07-12 03:09:29,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:09:29,052 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 99 transitions. [2022-07-12 03:09:29,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:09:29,052 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 99 transitions. [2022-07-12 03:09:29,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-12 03:09:29,053 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:09:29,053 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:09:29,090 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-07-12 03:09:29,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 03:09:29,276 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:09:29,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:09:29,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1889067684, now seen corresponding path program 1 times [2022-07-12 03:09:29,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:09:29,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [298300859] [2022-07-12 03:09:29,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:09:29,277 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:09:29,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:09:29,290 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 03:09:29,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-12 03:09:30,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:09:30,208 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-12 03:09:30,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:09:30,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:09:30,765 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:09:30,765 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:09:30,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [298300859] [2022-07-12 03:09:30,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [298300859] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:09:30,765 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:09:30,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 03:09:30,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628552362] [2022-07-12 03:09:30,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:09:30,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 03:09:30,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:09:30,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 03:09:30,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 03:09:30,766 INFO L87 Difference]: Start difference. First operand 74 states and 99 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) [2022-07-12 03:09:30,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:09:30,770 INFO L93 Difference]: Finished difference Result 131 states and 174 transitions. [2022-07-12 03:09:30,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 03:09:30,770 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 [2022-07-12 03:09:30,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:09:30,771 INFO L225 Difference]: With dead ends: 131 [2022-07-12 03:09:30,771 INFO L226 Difference]: Without dead ends: 78 [2022-07-12 03:09:30,771 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 03:09:30,772 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 5 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 13 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:09:30,772 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 363 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 13 Unchecked, 0.0s Time] [2022-07-12 03:09:30,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-07-12 03:09:30,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 74. [2022-07-12 03:09:30,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 67 states have (on average 1.3432835820895523) internal successors, (90), 67 states have internal predecessors, (90), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-12 03:09:30,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 98 transitions. [2022-07-12 03:09:30,775 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 98 transitions. Word has length 19 [2022-07-12 03:09:30,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:09:30,776 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 98 transitions. [2022-07-12 03:09:30,776 INFO L496 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) [2022-07-12 03:09:30,776 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 98 transitions. [2022-07-12 03:09:30,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-12 03:09:30,776 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:09:30,776 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:09:30,809 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-07-12 03:09:30,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 03:09:30,992 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:09:30,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:09:30,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1417522822, now seen corresponding path program 1 times [2022-07-12 03:09:30,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:09:30,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2040676465] [2022-07-12 03:09:30,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:09:30,993 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:09:30,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:09:30,994 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 03:09:30,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-07-12 03:09:31,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:09:31,825 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-12 03:09:31,826 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:09:33,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:09:33,320 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:09:33,320 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:09:33,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2040676465] [2022-07-12 03:09:33,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2040676465] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:09:33,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:09:33,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 03:09:33,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456047541] [2022-07-12 03:09:33,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:09:33,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 03:09:33,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:09:33,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 03:09:33,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 03:09:33,321 INFO L87 Difference]: Start difference. First operand 74 states and 98 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:09:37,820 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.41s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 03:09:40,613 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 [] [2022-07-12 03:09:42,705 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 03:09:46,602 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-12 03:09:48,689 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-12 03:09:50,935 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-12 03:09:53,116 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-12 03:09:54,850 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-12 03:09:54,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:09:54,983 INFO L93 Difference]: Finished difference Result 81 states and 105 transitions. [2022-07-12 03:09:54,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 03:09:54,984 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 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 [2022-07-12 03:09:54,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:09:54,987 INFO L225 Difference]: With dead ends: 81 [2022-07-12 03:09:54,987 INFO L226 Difference]: Without dead ends: 77 [2022-07-12 03:09:54,987 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-12 03:09:54,988 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 76 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 0 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.7s IncrementalHoareTripleChecker+Time [2022-07-12 03:09:54,988 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 210 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 75 Invalid, 6 Unknown, 0 Unchecked, 20.7s Time] [2022-07-12 03:09:54,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-07-12 03:09:54,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 74. [2022-07-12 03:09:54,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 67 states have (on average 1.328358208955224) internal successors, (89), 67 states have internal predecessors, (89), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-12 03:09:54,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 97 transitions. [2022-07-12 03:09:54,999 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 97 transitions. Word has length 19 [2022-07-12 03:09:54,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:09:54,999 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 97 transitions. [2022-07-12 03:09:54,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:09:54,999 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 97 transitions. [2022-07-12 03:09:55,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-12 03:09:55,000 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:09:55,000 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:09:55,031 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-07-12 03:09:55,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 03:09:55,201 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:09:55,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:09:55,201 INFO L85 PathProgramCache]: Analyzing trace with hash 992042301, now seen corresponding path program 1 times [2022-07-12 03:09:55,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:09:55,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1781620616] [2022-07-12 03:09:55,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:09:55,202 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:09:55,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:09:55,203 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 03:09:55,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-07-12 03:09:56,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:09:56,084 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-12 03:09:56,086 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:09:56,224 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 03:09:56,535 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2022-07-12 03:09:57,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:09:57,532 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:09:57,532 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:09:57,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1781620616] [2022-07-12 03:09:57,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1781620616] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:09:57,532 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:09:57,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 03:09:57,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048589500] [2022-07-12 03:09:57,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:09:57,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 03:09:57,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:09:57,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 03:09:57,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 03:09:57,534 INFO L87 Difference]: Start difference. First operand 74 states and 97 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:09:57,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:09:57,553 INFO L93 Difference]: Finished difference Result 108 states and 140 transitions. [2022-07-12 03:09:57,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 03:09:57,554 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 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 [2022-07-12 03:09:57,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:09:57,555 INFO L225 Difference]: With dead ends: 108 [2022-07-12 03:09:57,555 INFO L226 Difference]: Without dead ends: 46 [2022-07-12 03:09:57,556 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 03:09:57,558 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 0 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 21 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:09:57,559 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 303 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 21 Unchecked, 0.0s Time] [2022-07-12 03:09:57,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-07-12 03:09:57,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-07-12 03:09:57,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 41 states have (on average 1.2682926829268293) internal successors, (52), 41 states have internal predecessors, (52), 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) [2022-07-12 03:09:57,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 56 transitions. [2022-07-12 03:09:57,565 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 56 transitions. Word has length 20 [2022-07-12 03:09:57,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:09:57,565 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 56 transitions. [2022-07-12 03:09:57,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:09:57,565 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 56 transitions. [2022-07-12 03:09:57,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-12 03:09:57,566 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:09:57,566 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:09:57,598 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-07-12 03:09:57,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 03:09:57,776 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:09:57,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:09:57,777 INFO L85 PathProgramCache]: Analyzing trace with hash -1381153585, now seen corresponding path program 1 times [2022-07-12 03:09:57,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:09:57,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2020174211] [2022-07-12 03:09:57,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:09:57,777 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:09:57,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:09:57,779 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 03:09:57,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-07-12 03:09:58,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:09:58,628 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-12 03:09:58,630 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:09:58,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:09:58,919 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:09:58,919 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:09:58,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2020174211] [2022-07-12 03:09:58,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2020174211] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:09:58,919 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:09:58,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 03:09:58,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590179603] [2022-07-12 03:09:58,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:09:58,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 03:09:58,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:09:58,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 03:09:58,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:09:58,921 INFO L87 Difference]: Start difference. First operand 46 states and 56 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 03:09:58,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:09:58,922 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2022-07-12 03:09:58,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 03:09:58,922 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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 23 [2022-07-12 03:09:58,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:09:58,922 INFO L225 Difference]: With dead ends: 46 [2022-07-12 03:09:58,922 INFO L226 Difference]: Without dead ends: 0 [2022-07-12 03:09:58,923 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:09:58,923 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 0 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:09:58,924 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 14 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 3 Unchecked, 0.0s Time] [2022-07-12 03:09:58,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-12 03:09:58,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-12 03:09:58,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:09:58,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-12 03:09:58,924 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2022-07-12 03:09:58,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:09:58,925 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-12 03:09:58,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 03:09:58,925 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-12 03:09:58,925 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-12 03:09:58,927 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-12 03:09:58,957 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-07-12 03:09:59,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 03:09:59,148 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-12 03:09:59,986 INFO L899 garLoopResultBuilder]: For program point fabs_floatFINAL(lines 14 27) no Hoare annotation was computed. [2022-07-12 03:09:59,986 INFO L899 garLoopResultBuilder]: For program point fabs_floatEXIT(lines 14 27) no Hoare annotation was computed. [2022-07-12 03:09:59,986 INFO L902 garLoopResultBuilder]: At program point fabs_floatENTRY(lines 14 27) the Hoare annotation is: true [2022-07-12 03:09:59,986 INFO L899 garLoopResultBuilder]: For program point L21(lines 21 25) no Hoare annotation was computed. [2022-07-12 03:09:59,986 INFO L899 garLoopResultBuilder]: For program point L21-1(lines 14 27) no Hoare annotation was computed. [2022-07-12 03:09:59,986 INFO L899 garLoopResultBuilder]: For program point L21-2(lines 21 25) no Hoare annotation was computed. [2022-07-12 03:09:59,986 INFO L899 garLoopResultBuilder]: For program point L16-1(lines 16 20) no Hoare annotation was computed. [2022-07-12 03:09:59,986 INFO L902 garLoopResultBuilder]: At program point L16-2(lines 16 20) the Hoare annotation is: true [2022-07-12 03:09:59,987 INFO L895 garLoopResultBuilder]: At program point L192(line 192) the Hoare annotation is: false [2022-07-12 03:09:59,987 INFO L899 garLoopResultBuilder]: For program point L159(lines 159 168) no Hoare annotation was computed. [2022-07-12 03:09:59,987 INFO L895 garLoopResultBuilder]: At program point L192-1(line 192) the Hoare annotation is: false [2022-07-12 03:09:59,987 INFO L899 garLoopResultBuilder]: For program point L192-2(line 192) no Hoare annotation was computed. [2022-07-12 03:09:59,987 INFO L899 garLoopResultBuilder]: For program point L184(line 184) no Hoare annotation was computed. [2022-07-12 03:09:59,987 INFO L899 garLoopResultBuilder]: For program point L184-2(line 184) no Hoare annotation was computed. [2022-07-12 03:09:59,987 INFO L899 garLoopResultBuilder]: For program point L143(lines 143 151) no Hoare annotation was computed. [2022-07-12 03:09:59,987 INFO L899 garLoopResultBuilder]: For program point L193(lines 193 214) no Hoare annotation was computed. [2022-07-12 03:09:59,987 INFO L899 garLoopResultBuilder]: For program point L160(line 160) no Hoare annotation was computed. [2022-07-12 03:09:59,987 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-12 03:09:59,987 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-12 03:09:59,987 INFO L899 garLoopResultBuilder]: For program point L210(line 210) no Hoare annotation was computed. [2022-07-12 03:09:59,987 INFO L899 garLoopResultBuilder]: For program point L177(line 177) no Hoare annotation was computed. [2022-07-12 03:09:59,987 INFO L899 garLoopResultBuilder]: For program point L144(line 144) no Hoare annotation was computed. [2022-07-12 03:09:59,987 INFO L899 garLoopResultBuilder]: For program point L144-2(line 144) no Hoare annotation was computed. [2022-07-12 03:09:59,988 INFO L902 garLoopResultBuilder]: At program point L235(lines 217 236) the Hoare annotation is: true [2022-07-12 03:09:59,988 INFO L899 garLoopResultBuilder]: For program point L136(lines 136 137) no Hoare annotation was computed. [2022-07-12 03:09:59,988 INFO L899 garLoopResultBuilder]: For program point L194(line 194) no Hoare annotation was computed. [2022-07-12 03:09:59,988 INFO L895 garLoopResultBuilder]: At program point L120(lines 120 215) the Hoare annotation is: (and (= ~tiny_atan2~0 ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 1.0 1000000000000000000000000000000.0)))) (= (fp.sub roundNearestTiesToEven (fp.neg ~pi_o_4~0) ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000000000000000000000000000.0)))) |ULTIMATE.start___ieee754_atan2f_#res#1|) (= ~pi_o_4~0 ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 3141592741.0 4000000000.0)))) (= currentRoundingMode roundNearestTiesToEven)) [2022-07-12 03:09:59,988 INFO L899 garLoopResultBuilder]: For program point L145(line 145) no Hoare annotation was computed. [2022-07-12 03:09:59,988 INFO L899 garLoopResultBuilder]: For program point L203(lines 203 207) no Hoare annotation was computed. [2022-07-12 03:09:59,988 INFO L899 garLoopResultBuilder]: For program point L170(lines 170 179) no Hoare annotation was computed. [2022-07-12 03:09:59,989 INFO L899 garLoopResultBuilder]: For program point L203-1(lines 196 208) no Hoare annotation was computed. [2022-07-12 03:09:59,989 INFO L899 garLoopResultBuilder]: For program point L203-2(lines 203 207) no Hoare annotation was computed. [2022-07-12 03:09:59,989 INFO L899 garLoopResultBuilder]: For program point L162(line 162) no Hoare annotation was computed. [2022-07-12 03:09:59,989 INFO L899 garLoopResultBuilder]: For program point L187(lines 187 192) no Hoare annotation was computed. [2022-07-12 03:09:59,989 INFO L899 garLoopResultBuilder]: For program point L212(line 212) no Hoare annotation was computed. [2022-07-12 03:09:59,989 INFO L899 garLoopResultBuilder]: For program point L171(line 171) no Hoare annotation was computed. [2022-07-12 03:09:59,989 INFO L899 garLoopResultBuilder]: For program point L138(lines 138 139) no Hoare annotation was computed. [2022-07-12 03:09:59,989 INFO L899 garLoopResultBuilder]: For program point L196(line 196) no Hoare annotation was computed. [2022-07-12 03:09:59,989 INFO L899 garLoopResultBuilder]: For program point L130-1(lines 130 134) no Hoare annotation was computed. [2022-07-12 03:09:59,989 INFO L895 garLoopResultBuilder]: At program point L130-2(lines 130 134) the Hoare annotation is: (and (= ~tiny_atan2~0 ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 1.0 1000000000000000000000000000000.0)))) (= ~pi_o_4~0 ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 3141592741.0 4000000000.0)))) (exists ((|ULTIMATE.start___ieee754_atan2f_~hx~1#1| (_ BitVec 32))) (and (exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_atan2f_~hx~1#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_atan2f_~hx~1#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_atan2f_~hx~1#1|)) (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)))) (= |ULTIMATE.start___ieee754_atan2f_~ix~2#1| (bvand (_ bv2147483647 32) |ULTIMATE.start___ieee754_atan2f_~hx~1#1|)))) (exists ((|v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_16| (_ BitVec 32)) (currentRoundingMode RoundingMode)) (let ((.cse0 (select (select |#memory_int| |v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_16|) (_ bv0 32))) (.cse1 ((_ to_fp 8 24) currentRoundingMode 1.0))) (and (= |ULTIMATE.start___ieee754_atan2f_~hx~1#1| .cse0) (= (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0)) (fp.div currentRoundingMode .cse1 (_ +zero 8 24))) (= (fp.div currentRoundingMode (fp.neg .cse1) (_ +zero 8 24)) |ULTIMATE.start___ieee754_atan2f_~y#1|)))) (= currentRoundingMode roundNearestTiesToEven)) [2022-07-12 03:09:59,990 INFO L899 garLoopResultBuilder]: For program point L130-3(lines 130 134) no Hoare annotation was computed. [2022-07-12 03:09:59,990 INFO L899 garLoopResultBuilder]: For program point L155(line 155) no Hoare annotation was computed. [2022-07-12 03:09:59,990 INFO L899 garLoopResultBuilder]: For program point L155-2(line 155) no Hoare annotation was computed. [2022-07-12 03:09:59,990 INFO L899 garLoopResultBuilder]: For program point L147(line 147) no Hoare annotation was computed. [2022-07-12 03:09:59,990 INFO L895 garLoopResultBuilder]: At program point L139(line 139) the Hoare annotation is: false [2022-07-12 03:09:59,990 INFO L899 garLoopResultBuilder]: For program point L139-1(line 139) no Hoare annotation was computed. [2022-07-12 03:09:59,990 INFO L899 garLoopResultBuilder]: For program point L230(lines 230 233) no Hoare annotation was computed. [2022-07-12 03:09:59,990 INFO L899 garLoopResultBuilder]: For program point L164(line 164) no Hoare annotation was computed. [2022-07-12 03:09:59,990 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-12 03:09:59,990 INFO L899 garLoopResultBuilder]: For program point L189(lines 189 192) no Hoare annotation was computed. [2022-07-12 03:09:59,990 INFO L899 garLoopResultBuilder]: For program point L189-2(lines 187 192) no Hoare annotation was computed. [2022-07-12 03:09:59,990 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 231) no Hoare annotation was computed. [2022-07-12 03:09:59,990 INFO L899 garLoopResultBuilder]: For program point L173(line 173) no Hoare annotation was computed. [2022-07-12 03:09:59,990 INFO L899 garLoopResultBuilder]: For program point L231(line 231) no Hoare annotation was computed. [2022-07-12 03:09:59,991 INFO L899 garLoopResultBuilder]: For program point L198-1(lines 198 202) no Hoare annotation was computed. [2022-07-12 03:09:59,991 INFO L895 garLoopResultBuilder]: At program point L198-2(lines 198 202) the Hoare annotation is: false [2022-07-12 03:09:59,991 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-12 03:09:59,991 INFO L899 garLoopResultBuilder]: For program point L157(lines 157 181) no Hoare annotation was computed. [2022-07-12 03:09:59,991 INFO L899 garLoopResultBuilder]: For program point L157-1(lines 120 215) no Hoare annotation was computed. [2022-07-12 03:09:59,991 INFO L899 garLoopResultBuilder]: For program point L124-1(lines 124 128) no Hoare annotation was computed. [2022-07-12 03:09:59,992 INFO L895 garLoopResultBuilder]: At program point L124-2(lines 124 128) the Hoare annotation is: (and (= ~tiny_atan2~0 ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 1.0 1000000000000000000000000000000.0)))) (exists ((currentRoundingMode RoundingMode)) (let ((.cse0 ((_ to_fp 8 24) currentRoundingMode 1.0))) (and (= (fp.div currentRoundingMode .cse0 (_ +zero 8 24)) |ULTIMATE.start___ieee754_atan2f_~x#1|) (= (fp.div currentRoundingMode (fp.neg .cse0) (_ +zero 8 24)) |ULTIMATE.start___ieee754_atan2f_~y#1|)))) (= ~pi_o_4~0 ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 3141592741.0 4000000000.0)))) (= currentRoundingMode roundNearestTiesToEven)) [2022-07-12 03:09:59,992 INFO L899 garLoopResultBuilder]: For program point L124-3(lines 124 128) no Hoare annotation was computed. [2022-07-12 03:09:59,992 INFO L899 garLoopResultBuilder]: For program point L149(line 149) no Hoare annotation was computed. [2022-07-12 03:09:59,992 INFO L899 garLoopResultBuilder]: For program point L166(line 166) no Hoare annotation was computed. [2022-07-12 03:09:59,992 INFO L899 garLoopResultBuilder]: For program point L158(lines 158 180) no Hoare annotation was computed. [2022-07-12 03:09:59,992 INFO L899 garLoopResultBuilder]: For program point L175(line 175) no Hoare annotation was computed. [2022-07-12 03:09:59,992 INFO L899 garLoopResultBuilder]: For program point L142(lines 142 152) no Hoare annotation was computed. [2022-07-12 03:09:59,992 INFO L899 garLoopResultBuilder]: For program point L142-2(lines 120 215) no Hoare annotation was computed. [2022-07-12 03:09:59,992 INFO L899 garLoopResultBuilder]: For program point L64(lines 64 65) no Hoare annotation was computed. [2022-07-12 03:09:59,992 INFO L902 garLoopResultBuilder]: At program point atan_floatENTRY(lines 53 115) the Hoare annotation is: true [2022-07-12 03:09:59,992 INFO L899 garLoopResultBuilder]: For program point atan_floatFINAL(lines 53 115) no Hoare annotation was computed. [2022-07-12 03:09:59,993 INFO L899 garLoopResultBuilder]: For program point L73(lines 73 74) no Hoare annotation was computed. [2022-07-12 03:09:59,993 INFO L899 garLoopResultBuilder]: For program point L57-1(lines 57 61) no Hoare annotation was computed. [2022-07-12 03:09:59,993 INFO L902 garLoopResultBuilder]: At program point L57-2(lines 57 61) the Hoare annotation is: true [2022-07-12 03:09:59,993 INFO L899 garLoopResultBuilder]: For program point L57-3(lines 57 61) no Hoare annotation was computed. [2022-07-12 03:09:59,993 INFO L902 garLoopResultBuilder]: At program point L78(line 78) the Hoare annotation is: true [2022-07-12 03:09:59,993 INFO L899 garLoopResultBuilder]: For program point L78-1(line 78) no Hoare annotation was computed. [2022-07-12 03:09:59,993 INFO L899 garLoopResultBuilder]: For program point L66(lines 66 69) no Hoare annotation was computed. [2022-07-12 03:09:59,994 INFO L899 garLoopResultBuilder]: For program point L79(lines 79 95) no Hoare annotation was computed. [2022-07-12 03:09:59,994 INFO L899 garLoopResultBuilder]: For program point L71(lines 71 96) no Hoare annotation was computed. [2022-07-12 03:09:59,994 INFO L899 garLoopResultBuilder]: For program point atan_floatEXIT(lines 53 115) no Hoare annotation was computed. [2022-07-12 03:09:59,994 INFO L899 garLoopResultBuilder]: For program point L63(lines 63 70) no Hoare annotation was computed. [2022-07-12 03:09:59,994 INFO L899 garLoopResultBuilder]: For program point L88(lines 88 94) no Hoare annotation was computed. [2022-07-12 03:09:59,994 INFO L899 garLoopResultBuilder]: For program point L88-2(lines 71 96) no Hoare annotation was computed. [2022-07-12 03:09:59,994 INFO L899 garLoopResultBuilder]: For program point L113(line 113) no Hoare annotation was computed. [2022-07-12 03:09:59,994 INFO L899 garLoopResultBuilder]: For program point L80(lines 80 86) no Hoare annotation was computed. [2022-07-12 03:09:59,994 INFO L899 garLoopResultBuilder]: For program point L113-2(line 113) no Hoare annotation was computed. [2022-07-12 03:09:59,994 INFO L899 garLoopResultBuilder]: For program point L109(lines 109 114) no Hoare annotation was computed. [2022-07-12 03:09:59,995 INFO L899 garLoopResultBuilder]: For program point L72(lines 72 75) no Hoare annotation was computed. [2022-07-12 03:09:59,995 INFO L899 garLoopResultBuilder]: For program point L72-2(lines 72 75) no Hoare annotation was computed. [2022-07-12 03:09:59,998 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:09:59,999 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-12 03:10:00,012 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 03:10:00,013 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 03:10:00,013 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 03:10:00,013 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 03:10:00,015 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:10:00,017 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 03:10:00,017 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 03:10:00,017 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 03:10:00,017 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 03:10:00,018 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:10:00,018 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:10:00,018 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:10:00,018 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:10:00,018 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:10:00,019 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:10:00,019 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:10:00,019 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:10:00,019 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:10:00,027 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2f_~hx~1#1,QUANTIFIED] [2022-07-12 03:10:00,029 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2f_~hx~1#1,QUANTIFIED] [2022-07-12 03:10:00,029 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2f_~hx~1#1,QUANTIFIED] [2022-07-12 03:10:00,030 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 03:10:00,030 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 03:10:00,030 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2f_~hx~1#1,QUANTIFIED] [2022-07-12 03:10:00,030 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_16,QUANTIFIED] [2022-07-12 03:10:00,030 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_16,QUANTIFIED] [2022-07-12 03:10:00,034 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_16,QUANTIFIED] [2022-07-12 03:10:00,035 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_16,QUANTIFIED] [2022-07-12 03:10:00,035 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 03:10:00,035 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 03:10:00,035 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 03:10:00,035 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 03:10:00,035 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:10:00,036 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2f_~hx~1#1,QUANTIFIED] [2022-07-12 03:10:00,036 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2f_~hx~1#1,QUANTIFIED] [2022-07-12 03:10:00,036 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2f_~hx~1#1,QUANTIFIED] [2022-07-12 03:10:00,036 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 03:10:00,036 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 03:10:00,037 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2f_~hx~1#1,QUANTIFIED] [2022-07-12 03:10:00,037 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_16,QUANTIFIED] [2022-07-12 03:10:00,037 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_16,QUANTIFIED] [2022-07-12 03:10:00,037 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_16,QUANTIFIED] [2022-07-12 03:10:00,037 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_16,QUANTIFIED] [2022-07-12 03:10:00,037 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 03:10:00,038 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 03:10:00,038 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 03:10:00,038 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 03:10:00,038 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:10:00,039 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.07 03:10:00 BoogieIcfgContainer [2022-07-12 03:10:00,040 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-12 03:10:00,041 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-12 03:10:00,041 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-12 03:10:00,041 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-12 03:10:00,042 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:09:18" (3/4) ... [2022-07-12 03:10:00,046 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-12 03:10:00,050 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fabs_float [2022-07-12 03:10:00,051 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure atan_float [2022-07-12 03:10:00,055 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 27 nodes and edges [2022-07-12 03:10:00,056 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2022-07-12 03:10:00,056 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-07-12 03:10:00,057 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-12 03:10:00,079 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((tiny_atan2 == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1/1000000000000000000000000000000)) && (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~FLOAT(currentRoundingMode, ~to_fp~LONGDOUBLE(currentRoundingMode, 1.0), ~Pluszero~LONGDOUBLE()) == x && ~fp.div~FLOAT(currentRoundingMode, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE()) == y)) && pi_o_4 == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 3141592741/4000000000))) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven [2022-07-12 03:10:00,079 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((tiny_atan2 == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1/1000000000000000000000000000000)) && pi_o_4 == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 3141592741/4000000000))) && (\exists ULTIMATE.start___ieee754_atan2f_~hx~1#1 : bv32 :: (\exists currentRoundingMode : FloatRoundingMode :: ~fp~LONGDOUBLE(ULTIMATE.start___ieee754_atan2f_~hx~1#1[31:31], ULTIMATE.start___ieee754_atan2f_~hx~1#1[30:23], ULTIMATE.start___ieee754_atan2f_~hx~1#1[22:0]) == ~fp.div~FLOAT(currentRoundingMode, ~to_fp~LONGDOUBLE(currentRoundingMode, 1.0), ~Pluszero~LONGDOUBLE())) && ix == ~bvand32(2147483647bv32, ULTIMATE.start___ieee754_atan2f_~hx~1#1))) && (\exists v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_16 : bv32, currentRoundingMode : FloatRoundingMode :: (hx == unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_16][0bv32] && ~fp~LONGDOUBLE(unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_16][0bv32][31:31], unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_16][0bv32][30:23], unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_16][0bv32][22:0]) == ~fp.div~FLOAT(currentRoundingMode, ~to_fp~LONGDOUBLE(currentRoundingMode, 1.0), ~Pluszero~LONGDOUBLE())) && ~fp.div~FLOAT(currentRoundingMode, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE()) == y)) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven [2022-07-12 03:10:00,080 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((tiny_atan2 == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1/1000000000000000000000000000000)) && ~fp.sub~FLOAT(~roundNearestTiesToEven, ~fp.neg~FLOAT(pi_o_4), ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000))) == \result) && pi_o_4 == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 3141592741/4000000000))) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven [2022-07-12 03:10:00,114 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-12 03:10:00,114 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-12 03:10:00,115 INFO L158 Benchmark]: Toolchain (without parser) took 54994.64ms. Allocated memory was 58.7MB in the beginning and 71.3MB in the end (delta: 12.6MB). Free memory was 38.1MB in the beginning and 29.2MB in the end (delta: 9.0MB). Peak memory consumption was 22.8MB. Max. memory is 16.1GB. [2022-07-12 03:10:00,115 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 58.7MB. Free memory was 41.4MB in the beginning and 41.4MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 03:10:00,115 INFO L158 Benchmark]: CACSL2BoogieTranslator took 326.81ms. Allocated memory is still 58.7MB. Free memory was 38.0MB in the beginning and 40.8MB in the end (delta: -2.8MB). Peak memory consumption was 16.5MB. Max. memory is 16.1GB. [2022-07-12 03:10:00,116 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.13ms. Allocated memory is still 58.7MB. Free memory was 40.8MB in the beginning and 38.3MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-12 03:10:00,116 INFO L158 Benchmark]: Boogie Preprocessor took 45.44ms. Allocated memory is still 58.7MB. Free memory was 38.3MB in the beginning and 35.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 03:10:00,117 INFO L158 Benchmark]: RCFGBuilder took 12508.86ms. Allocated memory was 58.7MB in the beginning and 71.3MB in the end (delta: 12.6MB). Free memory was 35.5MB in the beginning and 38.3MB in the end (delta: -2.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-12 03:10:00,117 INFO L158 Benchmark]: TraceAbstraction took 41971.79ms. Allocated memory is still 71.3MB. Free memory was 37.7MB in the beginning and 35.0MB in the end (delta: 2.7MB). Peak memory consumption was 2.0MB. Max. memory is 16.1GB. [2022-07-12 03:10:00,117 INFO L158 Benchmark]: Witness Printer took 73.51ms. Allocated memory is still 71.3MB. Free memory was 35.0MB in the beginning and 29.2MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-12 03:10:00,120 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.18ms. Allocated memory is still 58.7MB. Free memory was 41.4MB in the beginning and 41.4MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 326.81ms. Allocated memory is still 58.7MB. Free memory was 38.0MB in the beginning and 40.8MB in the end (delta: -2.8MB). Peak memory consumption was 16.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.13ms. Allocated memory is still 58.7MB. Free memory was 40.8MB in the beginning and 38.3MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.44ms. Allocated memory is still 58.7MB. Free memory was 38.3MB in the beginning and 35.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 12508.86ms. Allocated memory was 58.7MB in the beginning and 71.3MB in the end (delta: 12.6MB). Free memory was 35.5MB in the beginning and 38.3MB in the end (delta: -2.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 41971.79ms. Allocated memory is still 71.3MB. Free memory was 37.7MB in the beginning and 35.0MB in the end (delta: 2.7MB). Peak memory consumption was 2.0MB. Max. memory is 16.1GB. * Witness Printer took 73.51ms. Allocated memory is still 71.3MB. Free memory was 35.0MB in the beginning and 29.2MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation 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[ULTIMATE.start___ieee754_atan2f_~hx~1#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2f_~hx~1#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2f_~hx~1#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2f_~hx~1#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2f_~hx~1#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2f_~hx~1#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2f_~hx~1#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2f_~hx~1#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven * 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: 231]: 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, 90 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 41.9s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 22.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 6 mSolverCounterUnknown, 125 SdHoareTripleChecker+Valid, 21.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 116 mSDsluCounter, 3380 SdHoareTripleChecker+Invalid, 20.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 174 IncrementalHoareTripleChecker+Unchecked, 2471 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 85 IncrementalHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 909 mSDtfsCounter, 85 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 165 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=90occurred in iteration=0, InterpolantAutomatonStates: 51, 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, 10 MinimizatonAttempts, 37 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 13 LocationsWithAnnotation, 51 PreInvPairs, 55 NumberOfFragments, 160 HoareAnnotationTreeSize, 51 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 13 FomulaSimplificationsInter, 90 FormulaSimplificationTreeSizeReductionInter, 0.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 7.4s SatisfiabilityAnalysisTime, 8.1s InterpolantComputationTime, 173 NumberOfCodeBlocks, 173 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 163 ConstructedInterpolants, 82 QuantifiedInterpolants, 2247 SizeOfPredicates, 70 NumberOfNonLiveVariables, 1191 ConjunctsInSsa, 105 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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: 198]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 217]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 124]: Loop Invariant [2022-07-12 03:10:00,140 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 03:10:00,140 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 03:10:00,140 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 03:10:00,140 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 03:10:00,141 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:10:00,141 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 03:10:00,141 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 03:10:00,143 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 03:10:00,143 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 03:10:00,144 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ((tiny_atan2 == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1/1000000000000000000000000000000)) && (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~FLOAT(currentRoundingMode, ~to_fp~LONGDOUBLE(currentRoundingMode, 1.0), ~Pluszero~LONGDOUBLE()) == x && ~fp.div~FLOAT(currentRoundingMode, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE()) == y)) && pi_o_4 == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 3141592741/4000000000))) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven - InvariantResult [Line: 120]: Loop Invariant [2022-07-12 03:10:00,149 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:10:00,149 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:10:00,149 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:10:00,149 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:10:00,149 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:10:00,150 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:10:00,150 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:10:00,150 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ((tiny_atan2 == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1/1000000000000000000000000000000)) && ~fp.sub~FLOAT(~roundNearestTiesToEven, ~fp.neg~FLOAT(pi_o_4), ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000))) == \result) && pi_o_4 == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 3141592741/4000000000))) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven - InvariantResult [Line: 16]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 130]: Loop Invariant [2022-07-12 03:10:00,151 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2f_~hx~1#1,QUANTIFIED] [2022-07-12 03:10:00,151 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2f_~hx~1#1,QUANTIFIED] [2022-07-12 03:10:00,151 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2f_~hx~1#1,QUANTIFIED] [2022-07-12 03:10:00,151 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 03:10:00,152 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 03:10:00,152 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2f_~hx~1#1,QUANTIFIED] [2022-07-12 03:10:00,152 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_16,QUANTIFIED] [2022-07-12 03:10:00,153 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_16,QUANTIFIED] [2022-07-12 03:10:00,153 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_16,QUANTIFIED] [2022-07-12 03:10:00,153 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_16,QUANTIFIED] [2022-07-12 03:10:00,154 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 03:10:00,154 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 03:10:00,154 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 03:10:00,154 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 03:10:00,154 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:10:00,155 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2f_~hx~1#1,QUANTIFIED] [2022-07-12 03:10:00,155 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2f_~hx~1#1,QUANTIFIED] [2022-07-12 03:10:00,155 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2f_~hx~1#1,QUANTIFIED] [2022-07-12 03:10:00,155 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 03:10:00,156 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 03:10:00,156 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2f_~hx~1#1,QUANTIFIED] [2022-07-12 03:10:00,156 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_16,QUANTIFIED] [2022-07-12 03:10:00,156 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_16,QUANTIFIED] [2022-07-12 03:10:00,156 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_16,QUANTIFIED] [2022-07-12 03:10:00,156 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_16,QUANTIFIED] [2022-07-12 03:10:00,156 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 03:10:00,156 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 03:10:00,157 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 03:10:00,157 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 03:10:00,157 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: (((tiny_atan2 == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1/1000000000000000000000000000000)) && pi_o_4 == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 3141592741/4000000000))) && (\exists ULTIMATE.start___ieee754_atan2f_~hx~1#1 : bv32 :: (\exists currentRoundingMode : FloatRoundingMode :: ~fp~LONGDOUBLE(ULTIMATE.start___ieee754_atan2f_~hx~1#1[31:31], ULTIMATE.start___ieee754_atan2f_~hx~1#1[30:23], ULTIMATE.start___ieee754_atan2f_~hx~1#1[22:0]) == ~fp.div~FLOAT(currentRoundingMode, ~to_fp~LONGDOUBLE(currentRoundingMode, 1.0), ~Pluszero~LONGDOUBLE())) && ix == ~bvand32(2147483647bv32, ULTIMATE.start___ieee754_atan2f_~hx~1#1))) && (\exists v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_16 : bv32, currentRoundingMode : FloatRoundingMode :: (hx == unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_16][0bv32] && ~fp~LONGDOUBLE(unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_16][0bv32][31:31], unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_16][0bv32][30:23], unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_16][0bv32][22:0]) == ~fp.div~FLOAT(currentRoundingMode, ~to_fp~LONGDOUBLE(currentRoundingMode, 1.0), ~Pluszero~LONGDOUBLE())) && ~fp.div~FLOAT(currentRoundingMode, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE()) == y)) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven RESULT: Ultimate proved your program to be correct! [2022-07-12 03:10:00,326 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE