./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/double_req_bl_0662a.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 35987657 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/double_req_bl_0662a.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 4ab31643130fe59fd572e1c725f7ce4686b4f219c563d19cc3c93d88df427f8c --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 01:37:21,912 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 01:37:21,915 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 01:37:21,963 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 01:37:21,964 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 01:37:21,965 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 01:37:21,966 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 01:37:21,967 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 01:37:21,968 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 01:37:21,969 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 01:37:21,970 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 01:37:21,971 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 01:37:21,971 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 01:37:21,972 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 01:37:21,973 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 01:37:21,974 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 01:37:21,975 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 01:37:21,975 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 01:37:21,977 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 01:37:21,978 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 01:37:21,984 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 01:37:21,986 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 01:37:21,988 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 01:37:21,989 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 01:37:21,990 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 01:37:21,994 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 01:37:21,995 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 01:37:21,995 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 01:37:21,996 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 01:37:21,997 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 01:37:21,997 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 01:37:21,998 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 01:37:21,999 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 01:37:21,999 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 01:37:22,001 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 01:37:22,002 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 01:37:22,002 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 01:37:22,003 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 01:37:22,003 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 01:37:22,003 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 01:37:22,004 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 01:37:22,006 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 01:37:22,011 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-21 01:37:22,039 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 01:37:22,040 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 01:37:22,040 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 01:37:22,040 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 01:37:22,041 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 01:37:22,041 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 01:37:22,042 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 01:37:22,042 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 01:37:22,043 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 01:37:22,044 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 01:37:22,044 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-21 01:37:22,044 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 01:37:22,044 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-21 01:37:22,044 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 01:37:22,044 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 01:37:22,045 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 01:37:22,045 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 01:37:22,045 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-21 01:37:22,045 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 01:37:22,046 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 01:37:22,046 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 01:37:22,046 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 01:37:22,046 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 01:37:22,046 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 01:37:22,047 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 01:37:22,047 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 01:37:22,047 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 01:37:22,047 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 01:37:22,047 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 01:37:22,047 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 01:37:22,048 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 01:37:22,048 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 01:37:22,048 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 01:37:22,048 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 -> 4ab31643130fe59fd572e1c725f7ce4686b4f219c563d19cc3c93d88df427f8c [2022-07-21 01:37:22,383 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 01:37:22,407 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 01:37:22,409 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 01:37:22,410 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 01:37:22,411 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 01:37:22,412 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_0662a.c [2022-07-21 01:37:22,467 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e417616e2/42fee07a8ae1439fa8f2c306a9c8d06b/FLAG271c01fe5 [2022-07-21 01:37:22,922 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 01:37:22,931 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_0662a.c [2022-07-21 01:37:22,941 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e417616e2/42fee07a8ae1439fa8f2c306a9c8d06b/FLAG271c01fe5 [2022-07-21 01:37:23,296 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e417616e2/42fee07a8ae1439fa8f2c306a9c8d06b [2022-07-21 01:37:23,298 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 01:37:23,301 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 01:37:23,302 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 01:37:23,302 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 01:37:23,305 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 01:37:23,306 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 01:37:23" (1/1) ... [2022-07-21 01:37:23,307 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23533a05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:37:23, skipping insertion in model container [2022-07-21 01:37:23,307 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 01:37:23" (1/1) ... [2022-07-21 01:37:23,313 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 01:37:23,349 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 01:37:23,533 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_0662a.c[6225,6238] [2022-07-21 01:37:23,550 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 01:37:23,565 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 01:37:23,646 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_0662a.c[6225,6238] [2022-07-21 01:37:23,653 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 01:37:23,671 INFO L208 MainTranslator]: Completed translation [2022-07-21 01:37:23,672 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:37:23 WrapperNode [2022-07-21 01:37:23,672 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 01:37:23,673 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 01:37:23,674 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 01:37:23,674 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 01:37:23,680 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:37:23" (1/1) ... [2022-07-21 01:37:23,702 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:37:23" (1/1) ... [2022-07-21 01:37:23,755 INFO L137 Inliner]: procedures = 19, calls = 87, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 263 [2022-07-21 01:37:23,759 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 01:37:23,760 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 01:37:23,761 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 01:37:23,761 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 01:37:23,768 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:37:23" (1/1) ... [2022-07-21 01:37:23,769 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:37:23" (1/1) ... [2022-07-21 01:37:23,785 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:37:23" (1/1) ... [2022-07-21 01:37:23,786 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:37:23" (1/1) ... [2022-07-21 01:37:23,817 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:37:23" (1/1) ... [2022-07-21 01:37:23,824 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:37:23" (1/1) ... [2022-07-21 01:37:23,836 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:37:23" (1/1) ... [2022-07-21 01:37:23,847 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 01:37:23,848 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 01:37:23,848 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 01:37:23,850 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 01:37:23,852 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:37:23" (1/1) ... [2022-07-21 01:37:23,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 01:37:23,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 01:37:23,885 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-21 01:37:23,912 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-21 01:37:23,936 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 01:37:23,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-21 01:37:23,937 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-21 01:37:23,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-07-21 01:37:23,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-21 01:37:23,937 INFO L130 BoogieDeclarations]: Found specification of procedure fabs_double [2022-07-21 01:37:23,938 INFO L138 BoogieDeclarations]: Found implementation of procedure fabs_double [2022-07-21 01:37:23,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-07-21 01:37:23,938 INFO L130 BoogieDeclarations]: Found specification of procedure atan_double [2022-07-21 01:37:23,938 INFO L138 BoogieDeclarations]: Found implementation of procedure atan_double [2022-07-21 01:37:23,939 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 01:37:23,939 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 01:37:23,939 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-21 01:37:23,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2022-07-21 01:37:23,945 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-21 01:37:24,092 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 01:37:24,094 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 01:37:24,532 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 01:37:24,540 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 01:37:24,542 INFO L299 CfgBuilder]: Removed 16 assume(true) statements. [2022-07-21 01:37:24,545 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 01:37:24 BoogieIcfgContainer [2022-07-21 01:37:24,545 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 01:37:24,548 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 01:37:24,548 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 01:37:24,551 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 01:37:24,552 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 01:37:23" (1/3) ... [2022-07-21 01:37:24,552 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32f4d4d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 01:37:24, skipping insertion in model container [2022-07-21 01:37:24,553 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:37:23" (2/3) ... [2022-07-21 01:37:24,553 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32f4d4d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 01:37:24, skipping insertion in model container [2022-07-21 01:37:24,553 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 01:37:24" (3/3) ... [2022-07-21 01:37:24,554 INFO L111 eAbstractionObserver]: Analyzing ICFG double_req_bl_0662a.c [2022-07-21 01:37:24,569 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 01:37:24,570 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-21 01:37:24,622 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 01:37:24,637 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@5399ed52, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@28931fb [2022-07-21 01:37:24,638 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-21 01:37:24,643 INFO L276 IsEmpty]: Start isEmpty. Operand has 107 states, 99 states have (on average 1.7373737373737375) internal successors, (172), 100 states have internal predecessors, (172), 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-21 01:37:24,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-21 01:37:24,648 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:37:24,649 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 01:37:24,649 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:37:24,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:37:24,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1187241542, now seen corresponding path program 1 times [2022-07-21 01:37:24,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 01:37:24,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153010050] [2022-07-21 01:37:24,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:37:24,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 01:37:24,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:37:24,870 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-21 01:37:24,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 01:37:24,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153010050] [2022-07-21 01:37:24,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153010050] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 01:37:24,872 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 01:37:24,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 01:37:24,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849866661] [2022-07-21 01:37:24,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 01:37:24,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-21 01:37:24,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 01:37:24,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-21 01:37:24,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-21 01:37:24,904 INFO L87 Difference]: Start difference. First operand has 107 states, 99 states have (on average 1.7373737373737375) internal successors, (172), 100 states have internal predecessors, (172), 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.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 01:37:24,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:37:24,932 INFO L93 Difference]: Finished difference Result 211 states and 360 transitions. [2022-07-21 01:37:24,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-21 01:37:24,934 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-21 01:37:24,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:37:24,941 INFO L225 Difference]: With dead ends: 211 [2022-07-21 01:37:24,941 INFO L226 Difference]: Without dead ends: 103 [2022-07-21 01:37:24,945 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-21 01:37:24,948 INFO L413 NwaCegarLoop]: 157 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, 157 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-21 01:37:24,951 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 01:37:24,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-07-21 01:37:24,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2022-07-21 01:37:24,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 96 states have (on average 1.5) internal successors, (144), 96 states have internal predecessors, (144), 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-21 01:37:24,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 152 transitions. [2022-07-21 01:37:24,993 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 152 transitions. Word has length 11 [2022-07-21 01:37:24,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:37:24,993 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 152 transitions. [2022-07-21 01:37:24,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 01:37:24,994 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 152 transitions. [2022-07-21 01:37:24,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-21 01:37:24,995 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:37:24,995 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 01:37:24,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-21 01:37:24,995 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:37:24,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:37:24,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1076214830, now seen corresponding path program 1 times [2022-07-21 01:37:24,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 01:37:24,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582060479] [2022-07-21 01:37:24,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:37:24,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 01:37:25,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-21 01:37:25,211 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-21 01:37:25,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-21 01:37:25,350 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-21 01:37:25,350 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-21 01:37:25,352 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-21 01:37:25,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-21 01:37:25,357 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1] [2022-07-21 01:37:25,360 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-21 01:37:25,410 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.07 01:37:25 BoogieIcfgContainer [2022-07-21 01:37:25,413 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-21 01:37:25,414 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-21 01:37:25,414 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-21 01:37:25,415 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-21 01:37:25,415 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 01:37:24" (3/4) ... [2022-07-21 01:37:25,418 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-21 01:37:25,419 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-21 01:37:25,420 INFO L158 Benchmark]: Toolchain (without parser) took 2118.53ms. Allocated memory was 52.4MB in the beginning and 77.6MB in the end (delta: 25.2MB). Free memory was 29.6MB in the beginning and 54.9MB in the end (delta: -25.3MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 01:37:25,421 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 52.4MB. Free memory was 34.2MB in the beginning and 34.2MB in the end (delta: 38.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 01:37:25,422 INFO L158 Benchmark]: CACSL2BoogieTranslator took 370.17ms. Allocated memory was 52.4MB in the beginning and 62.9MB in the end (delta: 10.5MB). Free memory was 29.4MB in the beginning and 43.1MB in the end (delta: -13.7MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. [2022-07-21 01:37:25,422 INFO L158 Benchmark]: Boogie Procedure Inliner took 86.31ms. Allocated memory is still 62.9MB. Free memory was 43.0MB in the beginning and 39.5MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-21 01:37:25,423 INFO L158 Benchmark]: Boogie Preprocessor took 86.77ms. Allocated memory is still 62.9MB. Free memory was 39.5MB in the beginning and 36.4MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-21 01:37:25,423 INFO L158 Benchmark]: RCFGBuilder took 697.45ms. Allocated memory is still 62.9MB. Free memory was 36.2MB in the beginning and 36.0MB in the end (delta: 213.6kB). Peak memory consumption was 13.8MB. Max. memory is 16.1GB. [2022-07-21 01:37:25,424 INFO L158 Benchmark]: TraceAbstraction took 864.93ms. Allocated memory was 62.9MB in the beginning and 77.6MB in the end (delta: 14.7MB). Free memory was 35.5MB in the beginning and 55.4MB in the end (delta: -19.9MB). Peak memory consumption was 17.4MB. Max. memory is 16.1GB. [2022-07-21 01:37:25,424 INFO L158 Benchmark]: Witness Printer took 5.02ms. Allocated memory is still 77.6MB. Free memory was 55.4MB in the beginning and 54.9MB in the end (delta: 478.7kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 01:37:25,428 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.22ms. Allocated memory is still 52.4MB. Free memory was 34.2MB in the beginning and 34.2MB in the end (delta: 38.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 370.17ms. Allocated memory was 52.4MB in the beginning and 62.9MB in the end (delta: 10.5MB). Free memory was 29.4MB in the beginning and 43.1MB in the end (delta: -13.7MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 86.31ms. Allocated memory is still 62.9MB. Free memory was 43.0MB in the beginning and 39.5MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 86.77ms. Allocated memory is still 62.9MB. Free memory was 39.5MB in the beginning and 36.4MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 697.45ms. Allocated memory is still 62.9MB. Free memory was 36.2MB in the beginning and 36.0MB in the end (delta: 213.6kB). Peak memory consumption was 13.8MB. Max. memory is 16.1GB. * TraceAbstraction took 864.93ms. Allocated memory was 62.9MB in the beginning and 77.6MB in the end (delta: 14.7MB). Free memory was 35.5MB in the beginning and 55.4MB in the end (delta: -19.9MB). Peak memory consumption was 17.4MB. Max. memory is 16.1GB. * Witness Printer took 5.02ms. Allocated memory is still 77.6MB. Free memory was 55.4MB in the beginning and 54.9MB in the end (delta: 478.7kB). 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: 262]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 164, overapproximation of someUnaryDOUBLEoperation at line 253, overapproximation of someBinaryArithmeticDOUBLEoperation at line 165, overapproximation of someBinaryDOUBLEComparisonOperation at line 261. Possible FailurePath: [L39-L44] static const double atanhi_atan[] = { 4.63647609000806093515e-01, 7.85398163397448278999e-01, 9.82793723247329054082e-01, 1.57079632679489655800e+00, }; [L46-L51] static const double atanlo_atan[] = { 2.26987774529616870924e-17, 3.06161699786838301793e-17, 1.39033110312309984516e-17, 6.12323399573676603587e-17, }; [L53-L60] static const double aT_atan[] = { 3.33333333333329318027e-01, -1.99999999998764832476e-01, 1.42857142725034663711e-01, -1.11111104054623557880e-01, 9.09088713343650656196e-02, -7.69187620504482999495e-02, 6.66107313738753120669e-02, -5.83357013379057348645e-02, 4.97687799461593236017e-02, -3.65315727442169155270e-02, 1.62858201153657823623e-02, }; [L62-L64] static const double one_atan = 1.0, pi_o_4 = 7.8539816339744827900E-01, pi_o_2 = 1.5707963267948965580E+00, pi = 3.1415926535897931160E+00, huge_atan = 1.0e300; [L141-L142] static const double tiny_atan2 = 1.0e-300, zero_atan2 = 0.0, pi_lo_atan2 = 1.2246467991473531772E-16; VAL [aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, zero_atan2=0] [L253] double x = -0.0; [L254] double y = __VERIFIER_nondet_double(); [L256] COND TRUE y < 0.0 [L258] CALL, EXPR __ieee754_atan2(y, x) [L145] double z; [L146] __int32_t k, m, hx, hy, ix, iy; [L147] __uint32_t lx, ly; VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003, \old(y)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003, y=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001, zero_atan2=0] [L150] ieee_double_shape_type ew_u; [L151] ew_u.value = (x) [L152] EXPR ew_u.parts.msw [L152] (hx) = ew_u.parts.msw [L153] EXPR ew_u.parts.lsw [L153] (lx) = ew_u.parts.lsw [L155] ix = hx & 0x7fffffff VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003, \old(y)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, hx=0, ix=0, lx=1, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003, y=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001, zero_atan2=0] [L157] ieee_double_shape_type ew_u; [L158] ew_u.value = (y) [L159] EXPR ew_u.parts.msw [L159] (hy) = ew_u.parts.msw [L160] EXPR ew_u.parts.lsw [L160] (ly) = ew_u.parts.lsw [L162] iy = hy & 0x7fffffff VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003, \old(y)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, hx=0, hy=0, ix=0, iy=0, lx=1, ly=10, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003, y=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001, zero_atan2=0] [L163-L164] COND TRUE ((ix | ((lx | -lx) >> 31)) > 0x7ff00000) || ((iy | ((ly | -ly) >> 31)) > 0x7ff00000) [L165] return x + y; VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003, \old(y)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, hx=0, hy=0, ix=0, iy=0, lx=1, ly=10, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003, y=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001, zero_atan2=0] [L258] RET, EXPR __ieee754_atan2(y, x) [L258] double res = __ieee754_atan2(y, x); [L261] COND TRUE res != -pi_o_2 VAL [aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, res=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003, y=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001, zero_atan2=0] [L262] reach_error() VAL [aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, res=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003, y=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001, zero_atan2=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 107 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.8s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 157 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 157 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=107occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 24 NumberOfCodeBlocks, 24 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 10 ConstructedInterpolants, 0 QuantifiedInterpolants, 10 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-07-21 01:37:25,480 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/double_req_bl_0662a.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 4ab31643130fe59fd572e1c725f7ce4686b4f219c563d19cc3c93d88df427f8c --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 01:37:27,422 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 01:37:27,425 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 01:37:27,477 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 01:37:27,477 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 01:37:27,479 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 01:37:27,484 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 01:37:27,487 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 01:37:27,490 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 01:37:27,496 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 01:37:27,497 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 01:37:27,502 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 01:37:27,502 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 01:37:27,504 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 01:37:27,505 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 01:37:27,509 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 01:37:27,509 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 01:37:27,510 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 01:37:27,511 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 01:37:27,513 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 01:37:27,516 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 01:37:27,517 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 01:37:27,519 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 01:37:27,521 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 01:37:27,521 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 01:37:27,534 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 01:37:27,537 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 01:37:27,537 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 01:37:27,539 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 01:37:27,539 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 01:37:27,540 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 01:37:27,541 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 01:37:27,542 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 01:37:27,543 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 01:37:27,544 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 01:37:27,545 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 01:37:27,546 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 01:37:27,547 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 01:37:27,547 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 01:37:27,547 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 01:37:27,548 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 01:37:27,550 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 01:37:27,553 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-21 01:37:27,576 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 01:37:27,577 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 01:37:27,578 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 01:37:27,578 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 01:37:27,579 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 01:37:27,579 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 01:37:27,579 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 01:37:27,580 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 01:37:27,580 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 01:37:27,581 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 01:37:27,581 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-21 01:37:27,581 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-21 01:37:27,582 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 01:37:27,582 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 01:37:27,582 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 01:37:27,582 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 01:37:27,582 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-21 01:37:27,583 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-21 01:37:27,583 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-21 01:37:27,583 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-21 01:37:27,583 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 01:37:27,583 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 01:37:27,584 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 01:37:27,584 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 01:37:27,584 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 01:37:27,584 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 01:37:27,584 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 01:37:27,585 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 01:37:27,585 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 01:37:27,585 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 01:37:27,585 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-21 01:37:27,586 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-21 01:37:27,586 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 01:37:27,586 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 01:37:27,586 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 01:37:27,587 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-21 01:37:27,587 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 -> 4ab31643130fe59fd572e1c725f7ce4686b4f219c563d19cc3c93d88df427f8c [2022-07-21 01:37:27,899 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 01:37:27,929 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 01:37:27,931 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 01:37:27,933 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 01:37:27,933 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 01:37:27,935 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_0662a.c [2022-07-21 01:37:27,993 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34d4a9a19/25fb6c0af14442b894cdd65f4fd83a1b/FLAGe0b653ef3 [2022-07-21 01:37:28,488 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 01:37:28,489 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_0662a.c [2022-07-21 01:37:28,500 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34d4a9a19/25fb6c0af14442b894cdd65f4fd83a1b/FLAGe0b653ef3 [2022-07-21 01:37:28,859 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34d4a9a19/25fb6c0af14442b894cdd65f4fd83a1b [2022-07-21 01:37:28,863 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 01:37:28,866 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 01:37:28,867 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 01:37:28,868 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 01:37:28,871 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 01:37:28,872 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 01:37:28" (1/1) ... [2022-07-21 01:37:28,874 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32736ab8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:37:28, skipping insertion in model container [2022-07-21 01:37:28,874 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 01:37:28" (1/1) ... [2022-07-21 01:37:28,882 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 01:37:28,918 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 01:37:29,221 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_0662a.c[6225,6238] [2022-07-21 01:37:29,224 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 01:37:29,235 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 01:37:29,309 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_0662a.c[6225,6238] [2022-07-21 01:37:29,315 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 01:37:29,341 INFO L208 MainTranslator]: Completed translation [2022-07-21 01:37:29,342 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:37:29 WrapperNode [2022-07-21 01:37:29,342 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 01:37:29,344 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 01:37:29,344 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 01:37:29,344 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 01:37:29,350 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:37:29" (1/1) ... [2022-07-21 01:37:29,375 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:37:29" (1/1) ... [2022-07-21 01:37:29,418 INFO L137 Inliner]: procedures = 22, calls = 87, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 228 [2022-07-21 01:37:29,420 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 01:37:29,421 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 01:37:29,421 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 01:37:29,422 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 01:37:29,430 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:37:29" (1/1) ... [2022-07-21 01:37:29,430 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:37:29" (1/1) ... [2022-07-21 01:37:29,449 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:37:29" (1/1) ... [2022-07-21 01:37:29,451 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:37:29" (1/1) ... [2022-07-21 01:37:29,465 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:37:29" (1/1) ... [2022-07-21 01:37:29,483 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:37:29" (1/1) ... [2022-07-21 01:37:29,486 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:37:29" (1/1) ... [2022-07-21 01:37:29,491 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 01:37:29,492 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 01:37:29,492 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 01:37:29,492 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 01:37:29,493 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:37:29" (1/1) ... [2022-07-21 01:37:29,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 01:37:29,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 01:37:29,541 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-21 01:37:29,569 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-21 01:37:29,586 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 01:37:29,587 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2022-07-21 01:37:29,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2022-07-21 01:37:29,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-21 01:37:29,587 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-21 01:37:29,587 INFO L130 BoogieDeclarations]: Found specification of procedure fabs_double [2022-07-21 01:37:29,587 INFO L138 BoogieDeclarations]: Found implementation of procedure fabs_double [2022-07-21 01:37:29,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8 [2022-07-21 01:37:29,588 INFO L130 BoogieDeclarations]: Found specification of procedure atan_double [2022-07-21 01:37:29,588 INFO L138 BoogieDeclarations]: Found implementation of procedure atan_double [2022-07-21 01:37:29,588 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-21 01:37:29,588 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 01:37:29,588 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 01:37:29,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-21 01:37:29,589 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-21 01:37:29,715 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 01:37:29,717 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 01:37:50,291 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 01:37:50,296 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 01:37:50,297 INFO L299 CfgBuilder]: Removed 16 assume(true) statements. [2022-07-21 01:37:50,299 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 01:37:50 BoogieIcfgContainer [2022-07-21 01:37:50,299 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 01:37:50,301 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 01:37:50,301 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 01:37:50,304 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 01:37:50,304 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 01:37:28" (1/3) ... [2022-07-21 01:37:50,305 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c68081 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 01:37:50, skipping insertion in model container [2022-07-21 01:37:50,305 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:37:29" (2/3) ... [2022-07-21 01:37:50,305 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c68081 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 01:37:50, skipping insertion in model container [2022-07-21 01:37:50,305 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 01:37:50" (3/3) ... [2022-07-21 01:37:50,306 INFO L111 eAbstractionObserver]: Analyzing ICFG double_req_bl_0662a.c [2022-07-21 01:37:50,328 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 01:37:50,328 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-21 01:37:50,374 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 01:37:50,384 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@15868afe, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6da59e5d [2022-07-21 01:37:50,384 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-21 01:37:50,389 INFO L276 IsEmpty]: Start isEmpty. Operand has 94 states, 86 states have (on average 1.6627906976744187) internal successors, (143), 87 states have internal predecessors, (143), 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-21 01:37:50,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-21 01:37:50,396 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:37:50,396 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 01:37:50,397 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:37:50,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:37:50,403 INFO L85 PathProgramCache]: Analyzing trace with hash 2113749773, now seen corresponding path program 1 times [2022-07-21 01:37:50,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 01:37:50,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [818069077] [2022-07-21 01:37:50,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:37:50,418 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 01:37:50,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 01:37:50,427 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-21 01:37:50,468 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-21 01:37:50,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:37:50,819 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-21 01:37:50,822 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:37:50,842 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-21 01:37:50,843 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 01:37:50,844 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 01:37:50,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [818069077] [2022-07-21 01:37:50,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [818069077] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 01:37:50,845 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 01:37:50,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 01:37:50,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628858278] [2022-07-21 01:37:50,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 01:37:50,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-21 01:37:50,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 01:37:50,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-21 01:37:50,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-21 01:37:50,887 INFO L87 Difference]: Start difference. First operand has 94 states, 86 states have (on average 1.6627906976744187) internal successors, (143), 87 states have internal predecessors, (143), 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.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 01:37:50,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:37:50,930 INFO L93 Difference]: Finished difference Result 185 states and 302 transitions. [2022-07-21 01:37:50,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-21 01:37:50,932 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-21 01:37:50,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:37:50,938 INFO L225 Difference]: With dead ends: 185 [2022-07-21 01:37:50,939 INFO L226 Difference]: Without dead ends: 90 [2022-07-21 01:37:50,942 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 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-21 01:37:50,945 INFO L413 NwaCegarLoop]: 134 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, 134 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-21 01:37:50,946 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 01:37:50,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-07-21 01:37:50,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2022-07-21 01:37:50,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 83 states have (on average 1.4578313253012047) internal successors, (121), 83 states have internal predecessors, (121), 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-21 01:37:51,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 129 transitions. [2022-07-21 01:37:51,002 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 129 transitions. Word has length 11 [2022-07-21 01:37:51,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:37:51,002 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 129 transitions. [2022-07-21 01:37:51,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 01:37:51,003 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 129 transitions. [2022-07-21 01:37:51,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-21 01:37:51,005 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:37:51,005 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 01:37:51,027 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-21 01:37:51,223 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-21 01:37:51,223 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:37:51,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:37:51,224 INFO L85 PathProgramCache]: Analyzing trace with hash -177099114, now seen corresponding path program 1 times [2022-07-21 01:37:51,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 01:37:51,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1345806379] [2022-07-21 01:37:51,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:37:51,225 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 01:37:51,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 01:37:51,227 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-21 01:37:51,229 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-21 01:37:51,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:37:51,649 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-21 01:37:51,652 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:37:52,559 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 16 [2022-07-21 01:37:54,431 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 18 treesize of output 10 [2022-07-21 01:37:58,575 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-21 01:37:58,576 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 01:37:58,576 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 01:37:58,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1345806379] [2022-07-21 01:37:58,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1345806379] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 01:37:58,577 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 01:37:58,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-21 01:37:58,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187542944] [2022-07-21 01:37:58,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 01:37:58,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 01:37:58,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 01:37:58,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 01:37:58,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=42, Unknown=1, NotChecked=0, Total=56 [2022-07-21 01:37:58,580 INFO L87 Difference]: Start difference. First operand 90 states and 129 transitions. Second operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 01:38:02,295 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.67s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 01:38:02,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:38:02,305 INFO L93 Difference]: Finished difference Result 94 states and 132 transitions. [2022-07-21 01:38:02,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-21 01:38:02,544 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-07-21 01:38:02,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:38:02,546 INFO L225 Difference]: With dead ends: 94 [2022-07-21 01:38:02,546 INFO L226 Difference]: Without dead ends: 90 [2022-07-21 01:38:02,546 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=23, Invalid=66, Unknown=1, NotChecked=0, Total=90 [2022-07-21 01:38:02,547 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 5 mSDsluCounter, 664 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 786 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 71 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-07-21 01:38:02,548 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 786 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 1 Unknown, 71 Unchecked, 2.8s Time] [2022-07-21 01:38:02,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-07-21 01:38:02,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2022-07-21 01:38:02,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 83 states have (on average 1.4457831325301205) internal successors, (120), 83 states have internal predecessors, (120), 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-21 01:38:02,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 128 transitions. [2022-07-21 01:38:02,557 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 128 transitions. Word has length 13 [2022-07-21 01:38:02,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:38:02,557 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 128 transitions. [2022-07-21 01:38:02,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 01:38:02,558 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 128 transitions. [2022-07-21 01:38:02,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-21 01:38:02,559 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:38:02,559 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-21 01:38:02,576 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-07-21 01:38:02,767 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-21 01:38:02,768 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:38:02,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:38:02,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1590624253, now seen corresponding path program 1 times [2022-07-21 01:38:02,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 01:38:02,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [843496792] [2022-07-21 01:38:02,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:38:02,769 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 01:38:02,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 01:38:02,771 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-21 01:38:02,772 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-21 01:38:03,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:38:03,107 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-21 01:38:03,109 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:38:04,542 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-21 01:38:04,542 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 01:38:04,542 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 01:38:04,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [843496792] [2022-07-21 01:38:04,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [843496792] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 01:38:04,542 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 01:38:04,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 01:38:04,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577721023] [2022-07-21 01:38:04,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 01:38:04,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 01:38:04,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 01:38:04,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 01:38:04,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 01:38:04,546 INFO L87 Difference]: Start difference. First operand 90 states and 128 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 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-21 01:38:06,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:38:06,810 INFO L93 Difference]: Finished difference Result 99 states and 135 transitions. [2022-07-21 01:38:06,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 01:38:06,810 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 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-21 01:38:06,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:38:06,812 INFO L225 Difference]: With dead ends: 99 [2022-07-21 01:38:06,812 INFO L226 Difference]: Without dead ends: 94 [2022-07-21 01:38:06,812 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-21 01:38:06,813 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 63 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 9 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 01:38:06,814 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 295 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 9 Unchecked, 0.0s Time] [2022-07-21 01:38:06,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-07-21 01:38:06,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 90. [2022-07-21 01:38:06,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 83 states have (on average 1.4337349397590362) internal successors, (119), 83 states have internal predecessors, (119), 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-21 01:38:06,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 127 transitions. [2022-07-21 01:38:06,821 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 127 transitions. Word has length 18 [2022-07-21 01:38:06,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:38:06,822 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 127 transitions. [2022-07-21 01:38:06,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 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-21 01:38:06,822 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 127 transitions. [2022-07-21 01:38:06,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-21 01:38:06,832 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:38:06,832 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-21 01:38:06,850 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-21 01:38:07,035 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-21 01:38:07,036 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:38:07,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:38:07,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1588777211, now seen corresponding path program 1 times [2022-07-21 01:38:07,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 01:38:07,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1088225039] [2022-07-21 01:38:07,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:38:07,037 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 01:38:07,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 01:38:07,040 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-21 01:38:07,042 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-21 01:38:07,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:38:07,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-21 01:38:07,417 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:38:13,099 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-21 01:38:13,099 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 01:38:13,100 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 01:38:13,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1088225039] [2022-07-21 01:38:13,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1088225039] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 01:38:13,100 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 01:38:13,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 01:38:13,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416535770] [2022-07-21 01:38:13,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 01:38:13,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 01:38:13,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 01:38:13,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 01:38:13,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 01:38:13,101 INFO L87 Difference]: Start difference. First operand 90 states and 127 transitions. Second operand has 6 states, 6 states have (on average 3.0) 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-21 01:38:18,802 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 01:38:26,208 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.63s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 01:38:28,213 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 01:38:30,218 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 01:38:32,608 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 01:38:35,751 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 01:38:40,311 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.54s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 01:38:43,137 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.82s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 01:38:45,505 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 01:38:47,811 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.30s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 01:38:50,833 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.72s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 01:38:51,915 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 01:38:54,345 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.26s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 01:38:57,941 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.66s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 01:39:00,913 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.97s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 01:39:03,774 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.86s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 01:39:06,581 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.81s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 01:39:07,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:39:07,876 INFO L93 Difference]: Finished difference Result 101 states and 137 transitions. [2022-07-21 01:39:07,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 01:39:07,878 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) 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-21 01:39:07,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:39:07,880 INFO L225 Difference]: With dead ends: 101 [2022-07-21 01:39:07,880 INFO L226 Difference]: Without dead ends: 95 [2022-07-21 01:39:07,881 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-07-21 01:39:07,881 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 105 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 1 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 47.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 50.9s IncrementalHoareTripleChecker+Time [2022-07-21 01:39:07,881 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 369 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 119 Invalid, 12 Unknown, 0 Unchecked, 50.9s Time] [2022-07-21 01:39:07,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-07-21 01:39:07,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 88. [2022-07-21 01:39:07,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 81 states have (on average 1.4320987654320987) internal successors, (116), 81 states have internal predecessors, (116), 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-21 01:39:07,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 124 transitions. [2022-07-21 01:39:07,888 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 124 transitions. Word has length 18 [2022-07-21 01:39:07,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:39:07,889 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 124 transitions. [2022-07-21 01:39:07,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) 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-21 01:39:07,889 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 124 transitions. [2022-07-21 01:39:07,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-21 01:39:07,890 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:39:07,890 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-21 01:39:07,909 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-21 01:39:08,098 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-21 01:39:08,099 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:39:08,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:39:08,099 INFO L85 PathProgramCache]: Analyzing trace with hash -809284995, now seen corresponding path program 1 times [2022-07-21 01:39:08,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 01:39:08,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [338089527] [2022-07-21 01:39:08,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:39:08,100 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 01:39:08,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 01:39:08,101 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-21 01:39:08,103 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-21 01:39:08,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:39:08,414 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-21 01:39:08,416 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:39:11,370 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-21 01:39:11,370 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 01:39:11,371 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 01:39:11,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [338089527] [2022-07-21 01:39:11,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [338089527] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 01:39:11,371 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 01:39:11,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 01:39:11,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878168871] [2022-07-21 01:39:11,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 01:39:11,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 01:39:11,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 01:39:11,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 01:39:11,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-21 01:39:11,372 INFO L87 Difference]: Start difference. First operand 88 states and 124 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 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-21 01:39:13,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:39:13,377 INFO L93 Difference]: Finished difference Result 177 states and 252 transitions. [2022-07-21 01:39:13,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-21 01:39:13,379 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 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-21 01:39:13,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:39:13,381 INFO L225 Difference]: With dead ends: 177 [2022-07-21 01:39:13,383 INFO L226 Difference]: Without dead ends: 104 [2022-07-21 01:39:13,383 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-21 01:39:13,386 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 23 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 27 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-07-21 01:39:13,387 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 668 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 27 Unchecked, 1.2s Time] [2022-07-21 01:39:13,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-07-21 01:39:13,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 88. [2022-07-21 01:39:13,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 81 states have (on average 1.4197530864197532) internal successors, (115), 81 states have internal predecessors, (115), 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-21 01:39:13,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 123 transitions. [2022-07-21 01:39:13,397 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 123 transitions. Word has length 18 [2022-07-21 01:39:13,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:39:13,397 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 123 transitions. [2022-07-21 01:39:13,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 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-21 01:39:13,397 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 123 transitions. [2022-07-21 01:39:13,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-21 01:39:13,398 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:39:13,398 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-21 01:39:13,413 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Ended with exit code 0 [2022-07-21 01:39:13,600 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-21 01:39:13,600 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:39:13,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:39:13,601 INFO L85 PathProgramCache]: Analyzing trace with hash -752026693, now seen corresponding path program 1 times [2022-07-21 01:39:13,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 01:39:13,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [49000228] [2022-07-21 01:39:13,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:39:13,602 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 01:39:13,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 01:39:13,603 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-21 01:39:13,625 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-21 01:39:13,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:39:13,873 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-21 01:39:13,875 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:39:18,536 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-21 01:39:18,537 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 01:39:18,537 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 01:39:18,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [49000228] [2022-07-21 01:39:18,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [49000228] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 01:39:18,537 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 01:39:18,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-21 01:39:18,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543778994] [2022-07-21 01:39:18,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 01:39:18,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 01:39:18,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 01:39:18,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 01:39:18,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-21 01:39:18,538 INFO L87 Difference]: Start difference. First operand 88 states and 123 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 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-21 01:39:23,425 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.71s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 01:39:23,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:39:23,428 INFO L93 Difference]: Finished difference Result 108 states and 149 transitions. [2022-07-21 01:39:23,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 01:39:23,649 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 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-21 01:39:23,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:39:23,650 INFO L225 Difference]: With dead ends: 108 [2022-07-21 01:39:23,650 INFO L226 Difference]: Without dead ends: 104 [2022-07-21 01:39:23,650 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-07-21 01:39:23,651 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 22 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 28 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-07-21 01:39:23,651 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 659 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 1 Unknown, 28 Unchecked, 4.1s Time] [2022-07-21 01:39:23,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-07-21 01:39:23,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 88. [2022-07-21 01:39:23,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 81 states have (on average 1.4074074074074074) internal successors, (114), 81 states have internal predecessors, (114), 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-21 01:39:23,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 122 transitions. [2022-07-21 01:39:23,659 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 122 transitions. Word has length 18 [2022-07-21 01:39:23,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:39:23,659 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 122 transitions. [2022-07-21 01:39:23,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 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-21 01:39:23,659 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 122 transitions. [2022-07-21 01:39:23,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-21 01:39:23,660 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:39:23,660 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-21 01:39:23,676 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-21 01:39:23,870 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-21 01:39:23,871 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:39:23,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:39:23,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1689344753, now seen corresponding path program 1 times [2022-07-21 01:39:23,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 01:39:23,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1391160275] [2022-07-21 01:39:23,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:39:23,872 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 01:39:23,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 01:39:23,873 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-21 01:39:23,875 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-21 01:39:24,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:39:24,139 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-21 01:39:24,140 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:39:26,720 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-21 01:39:26,720 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 01:39:26,721 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 01:39:26,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1391160275] [2022-07-21 01:39:26,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1391160275] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 01:39:26,721 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 01:39:26,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 01:39:26,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063318963] [2022-07-21 01:39:26,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 01:39:26,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 01:39:26,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 01:39:26,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 01:39:26,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 01:39:26,722 INFO L87 Difference]: Start difference. First operand 88 states and 122 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 01:39:30,056 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.59s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 01:39:30,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:39:30,060 INFO L93 Difference]: Finished difference Result 147 states and 199 transitions. [2022-07-21 01:39:30,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 01:39:30,287 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-07-21 01:39:30,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:39:30,287 INFO L225 Difference]: With dead ends: 147 [2022-07-21 01:39:30,287 INFO L226 Difference]: Without dead ends: 81 [2022-07-21 01:39:30,288 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-07-21 01:39:30,288 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 19 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 12 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-07-21 01:39:30,289 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 448 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 12 Unchecked, 2.7s Time] [2022-07-21 01:39:30,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-07-21 01:39:30,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 77. [2022-07-21 01:39:30,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 70 states have (on average 1.3285714285714285) internal successors, (93), 70 states have internal predecessors, (93), 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-21 01:39:30,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 101 transitions. [2022-07-21 01:39:30,299 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 101 transitions. Word has length 19 [2022-07-21 01:39:30,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:39:30,299 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 101 transitions. [2022-07-21 01:39:30,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 01:39:30,299 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 101 transitions. [2022-07-21 01:39:30,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-21 01:39:30,300 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:39:30,300 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-21 01:39:30,315 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-21 01:39:30,500 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-21 01:39:30,501 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:39:30,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:39:30,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1840764148, now seen corresponding path program 1 times [2022-07-21 01:39:30,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 01:39:30,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [789915752] [2022-07-21 01:39:30,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:39:30,502 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 01:39:30,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 01:39:30,503 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-21 01:39:30,504 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-21 01:39:30,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:39:30,827 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-21 01:39:30,830 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:39:31,798 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 16 [2022-07-21 01:39:33,161 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-07-21 01:39:41,243 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-21 01:39:41,243 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 01:39:41,243 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 01:39:41,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [789915752] [2022-07-21 01:39:41,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [789915752] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 01:39:41,243 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 01:39:41,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-21 01:39:41,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429124424] [2022-07-21 01:39:41,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 01:39:41,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-21 01:39:41,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 01:39:41,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-21 01:39:41,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-21 01:39:41,244 INFO L87 Difference]: Start difference. First operand 77 states and 101 transitions. Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 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-21 01:39:45,360 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.60s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 01:39:45,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:39:45,628 INFO L93 Difference]: Finished difference Result 81 states and 104 transitions. [2022-07-21 01:39:45,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-21 01:39:45,635 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 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-21 01:39:45,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:39:45,636 INFO L225 Difference]: With dead ends: 81 [2022-07-21 01:39:45,636 INFO L226 Difference]: Without dead ends: 77 [2022-07-21 01:39:45,637 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-07-21 01:39:45,637 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 5 mSDsluCounter, 563 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 649 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 52 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-07-21 01:39:45,638 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 649 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 1 Unknown, 52 Unchecked, 3.4s Time] [2022-07-21 01:39:45,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-07-21 01:39:45,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2022-07-21 01:39:45,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 70 states have (on average 1.3142857142857143) internal successors, (92), 70 states have internal predecessors, (92), 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-21 01:39:45,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 100 transitions. [2022-07-21 01:39:45,644 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 100 transitions. Word has length 19 [2022-07-21 01:39:45,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:39:45,644 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 100 transitions. [2022-07-21 01:39:45,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 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-21 01:39:45,644 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 100 transitions. [2022-07-21 01:39:45,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-21 01:39:45,645 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:39:45,645 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-21 01:39:45,661 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-21 01:39:45,851 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-21 01:39:45,852 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:39:45,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:39:45,852 INFO L85 PathProgramCache]: Analyzing trace with hash 590719438, now seen corresponding path program 1 times [2022-07-21 01:39:45,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 01:39:45,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1319489112] [2022-07-21 01:39:45,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:39:45,853 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 01:39:45,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 01:39:45,854 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-21 01:39:45,855 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-21 01:39:46,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:39:46,192 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-21 01:39:46,194 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:39:53,394 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-21 01:39:53,395 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 01:39:53,395 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 01:39:53,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1319489112] [2022-07-21 01:39:53,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1319489112] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 01:39:53,395 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 01:39:53,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 01:39:53,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136768814] [2022-07-21 01:39:53,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 01:39:53,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 01:39:53,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 01:39:53,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 01:39:53,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 01:39:53,397 INFO L87 Difference]: Start difference. First operand 77 states and 100 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 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-21 01:39:57,796 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 01:40:04,862 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.62s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 01:40:06,904 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 01:40:08,907 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 01:40:12,734 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 01:40:14,447 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 01:40:19,383 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.60s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 01:40:22,234 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.85s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 01:40:24,210 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 01:40:26,687 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 01:40:28,988 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.30s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 01:40:30,548 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 01:40:34,147 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.66s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 01:40:36,158 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 01:40:38,163 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 01:40:41,247 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.71s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 01:40:43,072 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 01:40:45,094 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 01:40:47,110 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 01:40:49,115 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 01:40:51,973 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.86s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 01:40:54,884 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.91s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 01:40:57,184 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.30s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 01:40:57,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:40:57,293 INFO L93 Difference]: Finished difference Result 100 states and 126 transitions. [2022-07-21 01:40:57,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 01:40:57,294 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 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-21 01:40:57,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:40:57,295 INFO L225 Difference]: With dead ends: 100 [2022-07-21 01:40:57,295 INFO L226 Difference]: Without dead ends: 95 [2022-07-21 01:40:57,295 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-07-21 01:40:57,296 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 77 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 1 mSolverCounterUnsat, 18 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 56.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 18 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 59.2s IncrementalHoareTripleChecker+Time [2022-07-21 01:40:57,296 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 366 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 84 Invalid, 18 Unknown, 0 Unchecked, 59.2s Time] [2022-07-21 01:40:57,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-07-21 01:40:57,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 77. [2022-07-21 01:40:57,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 70 states have (on average 1.3) internal successors, (91), 70 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-21 01:40:57,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 99 transitions. [2022-07-21 01:40:57,302 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 99 transitions. Word has length 20 [2022-07-21 01:40:57,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:40:57,303 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 99 transitions. [2022-07-21 01:40:57,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 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-21 01:40:57,303 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 99 transitions. [2022-07-21 01:40:57,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-21 01:40:57,304 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:40:57,304 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-21 01:40:57,324 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-21 01:40:57,524 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-21 01:40:57,525 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:40:57,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:40:57,525 INFO L85 PathProgramCache]: Analyzing trace with hash 592566480, now seen corresponding path program 1 times [2022-07-21 01:40:57,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 01:40:57,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1186949284] [2022-07-21 01:40:57,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:40:57,526 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 01:40:57,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 01:40:57,528 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-21 01:40:57,529 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-21 01:40:57,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:40:57,862 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-21 01:40:57,864 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:41:01,810 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-21 01:41:01,810 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 01:41:01,810 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 01:41:01,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1186949284] [2022-07-21 01:41:01,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1186949284] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 01:41:01,811 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 01:41:01,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 01:41:01,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464611216] [2022-07-21 01:41:01,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 01:41:01,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 01:41:01,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 01:41:01,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 01:41:01,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=6, Unknown=1, NotChecked=0, Total=12 [2022-07-21 01:41:01,812 INFO L87 Difference]: Start difference. First operand 77 states and 99 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 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-21 01:41:02,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:41:02,162 INFO L93 Difference]: Finished difference Result 81 states and 102 transitions. [2022-07-21 01:41:02,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 01:41:02,162 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 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-21 01:41:02,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:41:02,163 INFO L225 Difference]: With dead ends: 81 [2022-07-21 01:41:02,163 INFO L226 Difference]: Without dead ends: 75 [2022-07-21 01:41:02,164 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=9, Invalid=10, Unknown=1, NotChecked=0, Total=20 [2022-07-21 01:41:02,164 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 36 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 8 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 01:41:02,165 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 228 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 8 Unchecked, 0.0s Time] [2022-07-21 01:41:02,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-07-21 01:41:02,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2022-07-21 01:41:02,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 68 states have (on average 1.2941176470588236) internal successors, (88), 68 states have internal predecessors, (88), 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-21 01:41:02,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 96 transitions. [2022-07-21 01:41:02,170 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 96 transitions. Word has length 20 [2022-07-21 01:41:02,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:41:02,170 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 96 transitions. [2022-07-21 01:41:02,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 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-21 01:41:02,171 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 96 transitions. [2022-07-21 01:41:02,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-21 01:41:02,171 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:41:02,171 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-21 01:41:02,196 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-21 01:41:02,390 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-21 01:41:02,391 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:41:02,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:41:02,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1231737930, now seen corresponding path program 1 times [2022-07-21 01:41:02,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 01:41:02,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1443948468] [2022-07-21 01:41:02,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:41:02,392 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 01:41:02,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 01:41:02,393 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 01:41:02,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-07-21 01:41:02,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:41:02,808 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-21 01:41:02,810 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:41:04,865 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-21 01:41:04,866 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 01:41:04,866 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 01:41:04,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1443948468] [2022-07-21 01:41:04,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1443948468] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 01:41:04,866 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 01:41:04,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 01:41:04,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298986264] [2022-07-21 01:41:04,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 01:41:04,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 01:41:04,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 01:41:04,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 01:41:04,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 01:41:04,867 INFO L87 Difference]: Start difference. First operand 75 states and 96 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 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-21 01:41:09,908 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.65s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 01:41:09,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:41:09,912 INFO L93 Difference]: Finished difference Result 134 states and 171 transitions. [2022-07-21 01:41:10,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 01:41:10,154 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 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-21 01:41:10,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:41:10,155 INFO L225 Difference]: With dead ends: 134 [2022-07-21 01:41:10,155 INFO L226 Difference]: Without dead ends: 73 [2022-07-21 01:41:10,155 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=11, Invalid=18, Unknown=1, NotChecked=0, Total=30 [2022-07-21 01:41:10,156 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 7 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 11 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-07-21 01:41:10,156 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 327 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 1 Unknown, 11 Unchecked, 2.7s Time] [2022-07-21 01:41:10,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-07-21 01:41:10,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 69. [2022-07-21 01:41:10,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 62 states have (on average 1.2903225806451613) internal successors, (80), 62 states have internal predecessors, (80), 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-21 01:41:10,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 88 transitions. [2022-07-21 01:41:10,161 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 88 transitions. Word has length 20 [2022-07-21 01:41:10,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:41:10,161 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 88 transitions. [2022-07-21 01:41:10,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 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-21 01:41:10,161 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 88 transitions. [2022-07-21 01:41:10,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-21 01:41:10,162 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:41:10,162 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] [2022-07-21 01:41:10,179 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Ended with exit code 0 [2022-07-21 01:41:10,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 01:41:10,362 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:41:10,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:41:10,363 INFO L85 PathProgramCache]: Analyzing trace with hash 802050970, now seen corresponding path program 1 times [2022-07-21 01:41:10,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 01:41:10,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1905863025] [2022-07-21 01:41:10,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:41:10,363 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 01:41:10,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 01:41:10,365 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 01:41:10,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-07-21 01:41:10,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:41:10,792 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-21 01:41:10,794 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:41:14,519 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-21 01:41:14,519 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 01:41:14,520 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 01:41:14,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1905863025] [2022-07-21 01:41:14,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1905863025] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 01:41:14,520 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 01:41:14,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 01:41:14,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776495883] [2022-07-21 01:41:14,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 01:41:14,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 01:41:14,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 01:41:14,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 01:41:14,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-21 01:41:14,521 INFO L87 Difference]: Start difference. First operand 69 states and 88 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 01:41:17,284 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 01:41:18,817 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 01:41:18,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:41:18,880 INFO L93 Difference]: Finished difference Result 73 states and 91 transitions. [2022-07-21 01:41:18,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-21 01:41:18,880 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-07-21 01:41:18,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:41:18,881 INFO L225 Difference]: With dead ends: 73 [2022-07-21 01:41:18,881 INFO L226 Difference]: Without dead ends: 69 [2022-07-21 01:41:18,882 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-21 01:41:18,882 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 9 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 13 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-07-21 01:41:18,882 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 450 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 13 Unchecked, 3.6s Time] [2022-07-21 01:41:18,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-07-21 01:41:18,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2022-07-21 01:41:18,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 62 states have (on average 1.2741935483870968) internal successors, (79), 62 states have internal predecessors, (79), 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-21 01:41:18,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 87 transitions. [2022-07-21 01:41:18,887 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 87 transitions. Word has length 21 [2022-07-21 01:41:18,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:41:18,888 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 87 transitions. [2022-07-21 01:41:18,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 01:41:18,888 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 87 transitions. [2022-07-21 01:41:18,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-21 01:41:18,889 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:41:18,889 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-21 01:41:18,910 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-07-21 01:41:19,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 01:41:19,090 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:41:19,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:41:19,090 INFO L85 PathProgramCache]: Analyzing trace with hash 2015754869, now seen corresponding path program 1 times [2022-07-21 01:41:19,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 01:41:19,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1768852248] [2022-07-21 01:41:19,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:41:19,091 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 01:41:19,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 01:41:19,092 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 01:41:19,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-07-21 01:41:19,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:41:19,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-21 01:41:19,610 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:41:20,566 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 16 [2022-07-21 01:41:21,935 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-07-21 01:41:38,000 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-21 01:41:38,000 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 01:41:38,000 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 01:41:38,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1768852248] [2022-07-21 01:41:38,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1768852248] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 01:41:38,001 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 01:41:38,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-21 01:41:38,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534841855] [2022-07-21 01:41:38,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 01:41:38,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-21 01:41:38,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 01:41:38,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-21 01:41:38,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=85, Unknown=2, NotChecked=0, Total=110 [2022-07-21 01:41:38,002 INFO L87 Difference]: Start difference. First operand 69 states and 87 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 01:41:41,632 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 01:41:41,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:41:41,706 INFO L93 Difference]: Finished difference Result 73 states and 90 transitions. [2022-07-21 01:41:41,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-21 01:41:41,707 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-07-21 01:41:41,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:41:41,707 INFO L225 Difference]: With dead ends: 73 [2022-07-21 01:41:41,707 INFO L226 Difference]: Without dead ends: 69 [2022-07-21 01:41:41,708 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=33, Invalid=121, Unknown=2, NotChecked=0, Total=156 [2022-07-21 01:41:41,708 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 11 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 53 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-07-21 01:41:41,709 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 528 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 53 Unchecked, 2.5s Time] [2022-07-21 01:41:41,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-07-21 01:41:41,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2022-07-21 01:41:41,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 62 states have (on average 1.2580645161290323) internal successors, (78), 62 states have internal predecessors, (78), 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-21 01:41:41,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 86 transitions. [2022-07-21 01:41:41,713 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 86 transitions. Word has length 23 [2022-07-21 01:41:41,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:41:41,714 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 86 transitions. [2022-07-21 01:41:41,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 01:41:41,714 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 86 transitions. [2022-07-21 01:41:41,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-21 01:41:41,715 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:41:41,715 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 01:41:41,739 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-07-21 01:41:41,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 01:41:41,920 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:41:41,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:41:41,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1934442787, now seen corresponding path program 1 times [2022-07-21 01:41:41,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 01:41:41,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2123599164] [2022-07-21 01:41:41,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:41:41,921 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 01:41:41,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 01:41:41,922 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 01:41:41,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-07-21 01:41:42,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:41:42,711 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-21 01:41:42,713 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:41:46,280 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-21 01:41:46,280 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 01:41:46,280 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 01:41:46,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2123599164] [2022-07-21 01:41:46,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2123599164] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 01:41:46,280 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 01:41:46,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 01:41:46,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869615702] [2022-07-21 01:41:46,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 01:41:46,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 01:41:46,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 01:41:46,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 01:41:46,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 01:41:46,282 INFO L87 Difference]: Start difference. First operand 69 states and 86 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 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-21 01:41:47,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:41:47,335 INFO L93 Difference]: Finished difference Result 105 states and 131 transitions. [2022-07-21 01:41:47,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 01:41:47,335 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 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 24 [2022-07-21 01:41:47,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:41:47,336 INFO L225 Difference]: With dead ends: 105 [2022-07-21 01:41:47,336 INFO L226 Difference]: Without dead ends: 49 [2022-07-21 01:41:47,336 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-07-21 01:41:47,337 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 5 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 7 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 01:41:47,337 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 267 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 7 Unchecked, 0.1s Time] [2022-07-21 01:41:47,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-07-21 01:41:47,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2022-07-21 01:41:47,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 44 states have (on average 1.25) internal successors, (55), 44 states have internal predecessors, (55), 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-21 01:41:47,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 59 transitions. [2022-07-21 01:41:47,341 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 59 transitions. Word has length 24 [2022-07-21 01:41:47,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:41:47,342 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 59 transitions. [2022-07-21 01:41:47,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 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-21 01:41:47,342 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 59 transitions. [2022-07-21 01:41:47,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-21 01:41:47,343 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:41:47,343 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 01:41:47,371 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-07-21 01:41:47,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 01:41:47,545 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:41:47,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:41:47,545 INFO L85 PathProgramCache]: Analyzing trace with hash 497810342, now seen corresponding path program 1 times [2022-07-21 01:41:47,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 01:41:47,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1081058198] [2022-07-21 01:41:47,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:41:47,546 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 01:41:47,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 01:41:47,547 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 01:41:47,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-07-21 01:41:47,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:41:47,912 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-21 01:41:47,914 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:41:49,811 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-21 01:41:49,811 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 01:41:49,811 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 01:41:49,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1081058198] [2022-07-21 01:41:49,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1081058198] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 01:41:49,812 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 01:41:49,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 01:41:49,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211706411] [2022-07-21 01:41:49,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 01:41:49,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 01:41:49,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 01:41:49,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 01:41:49,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 01:41:49,813 INFO L87 Difference]: Start difference. First operand 49 states and 59 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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-21 01:41:50,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:41:50,626 INFO L93 Difference]: Finished difference Result 49 states and 59 transitions. [2022-07-21 01:41:50,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 01:41:50,626 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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 26 [2022-07-21 01:41:50,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:41:50,626 INFO L225 Difference]: With dead ends: 49 [2022-07-21 01:41:50,626 INFO L226 Difference]: Without dead ends: 0 [2022-07-21 01:41:50,627 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-21 01:41:50,627 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 5 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 01:41:50,628 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 20 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 2 Unchecked, 0.1s Time] [2022-07-21 01:41:50,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-21 01:41:50,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-21 01:41:50,628 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-21 01:41:50,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-21 01:41:50,628 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2022-07-21 01:41:50,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:41:50,629 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-21 01:41:50,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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-21 01:41:50,629 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-21 01:41:50,629 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-21 01:41:50,632 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-21 01:41:50,652 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-07-21 01:41:50,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 01:41:50,834 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-21 01:41:53,490 INFO L899 garLoopResultBuilder]: For program point L26(lines 26 31) no Hoare annotation was computed. [2022-07-21 01:41:53,491 INFO L899 garLoopResultBuilder]: For program point L26-1(lines 19 33) no Hoare annotation was computed. [2022-07-21 01:41:53,491 INFO L899 garLoopResultBuilder]: For program point fabs_doubleEXIT(lines 19 33) no Hoare annotation was computed. [2022-07-21 01:41:53,491 INFO L899 garLoopResultBuilder]: For program point L26-2(lines 26 31) no Hoare annotation was computed. [2022-07-21 01:41:53,491 INFO L902 garLoopResultBuilder]: At program point fabs_doubleENTRY(lines 19 33) the Hoare annotation is: true [2022-07-21 01:41:53,491 INFO L899 garLoopResultBuilder]: For program point L21-1(lines 21 25) no Hoare annotation was computed. [2022-07-21 01:41:53,491 INFO L902 garLoopResultBuilder]: At program point L21-2(lines 21 25) the Hoare annotation is: true [2022-07-21 01:41:53,491 INFO L899 garLoopResultBuilder]: For program point fabs_doubleFINAL(lines 19 33) no Hoare annotation was computed. [2022-07-21 01:41:53,492 INFO L902 garLoopResultBuilder]: At program point L97(line 97) the Hoare annotation is: true [2022-07-21 01:41:53,492 INFO L899 garLoopResultBuilder]: For program point L97-1(line 97) no Hoare annotation was computed. [2022-07-21 01:41:53,492 INFO L899 garLoopResultBuilder]: For program point L85(lines 85 88) no Hoare annotation was computed. [2022-07-21 01:41:53,492 INFO L899 garLoopResultBuilder]: For program point L98(lines 98 114) no Hoare annotation was computed. [2022-07-21 01:41:53,492 INFO L899 garLoopResultBuilder]: For program point L90(lines 90 115) no Hoare annotation was computed. [2022-07-21 01:41:53,492 INFO L899 garLoopResultBuilder]: For program point L78-1(lines 78 82) no Hoare annotation was computed. [2022-07-21 01:41:53,492 INFO L902 garLoopResultBuilder]: At program point L78-2(lines 78 82) the Hoare annotation is: true [2022-07-21 01:41:53,492 INFO L899 garLoopResultBuilder]: For program point L78-3(lines 76 89) no Hoare annotation was computed. [2022-07-21 01:41:53,493 INFO L899 garLoopResultBuilder]: For program point L107(lines 107 113) no Hoare annotation was computed. [2022-07-21 01:41:53,493 INFO L899 garLoopResultBuilder]: For program point L107-2(lines 90 115) no Hoare annotation was computed. [2022-07-21 01:41:53,493 INFO L899 garLoopResultBuilder]: For program point L70-1(lines 70 74) no Hoare annotation was computed. [2022-07-21 01:41:53,493 INFO L902 garLoopResultBuilder]: At program point L70-2(lines 70 74) the Hoare annotation is: true [2022-07-21 01:41:53,493 INFO L899 garLoopResultBuilder]: For program point L132(line 132) no Hoare annotation was computed. [2022-07-21 01:41:53,493 INFO L899 garLoopResultBuilder]: For program point L70-3(lines 70 74) no Hoare annotation was computed. [2022-07-21 01:41:53,493 INFO L899 garLoopResultBuilder]: For program point L99(lines 99 105) no Hoare annotation was computed. [2022-07-21 01:41:53,494 INFO L899 garLoopResultBuilder]: For program point L132-2(line 132) no Hoare annotation was computed. [2022-07-21 01:41:53,494 INFO L899 garLoopResultBuilder]: For program point L128(lines 128 133) no Hoare annotation was computed. [2022-07-21 01:41:53,494 INFO L899 garLoopResultBuilder]: For program point L91(lines 91 94) no Hoare annotation was computed. [2022-07-21 01:41:53,494 INFO L899 garLoopResultBuilder]: For program point L91-2(lines 91 94) no Hoare annotation was computed. [2022-07-21 01:41:53,494 INFO L899 garLoopResultBuilder]: For program point atan_doubleEXIT(lines 66 134) no Hoare annotation was computed. [2022-07-21 01:41:53,494 INFO L899 garLoopResultBuilder]: For program point L92(lines 92 93) no Hoare annotation was computed. [2022-07-21 01:41:53,494 INFO L902 garLoopResultBuilder]: At program point atan_doubleENTRY(lines 66 134) the Hoare annotation is: true [2022-07-21 01:41:53,495 INFO L899 garLoopResultBuilder]: For program point L76(lines 76 89) no Hoare annotation was computed. [2022-07-21 01:41:53,495 INFO L899 garLoopResultBuilder]: For program point atan_doubleFINAL(lines 66 134) no Hoare annotation was computed. [2022-07-21 01:41:53,495 INFO L899 garLoopResultBuilder]: For program point L217(lines 217 220) no Hoare annotation was computed. [2022-07-21 01:41:53,495 INFO L899 garLoopResultBuilder]: For program point L217-2(lines 215 220) no Hoare annotation was computed. [2022-07-21 01:41:53,495 INFO L902 garLoopResultBuilder]: At program point L267(lines 246 268) the Hoare annotation is: true [2022-07-21 01:41:53,495 INFO L899 garLoopResultBuilder]: For program point L201(line 201) no Hoare annotation was computed. [2022-07-21 01:41:53,495 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-21 01:41:53,496 INFO L899 garLoopResultBuilder]: For program point L185(lines 185 209) no Hoare annotation was computed. [2022-07-21 01:41:53,496 INFO L899 garLoopResultBuilder]: For program point L185-1(lines 144 244) no Hoare annotation was computed. [2022-07-21 01:41:53,496 INFO L899 garLoopResultBuilder]: For program point L186(lines 186 208) no Hoare annotation was computed. [2022-07-21 01:41:53,496 INFO L899 garLoopResultBuilder]: For program point L203(line 203) no Hoare annotation was computed. [2022-07-21 01:41:53,496 INFO L899 garLoopResultBuilder]: For program point L170(lines 170 180) no Hoare annotation was computed. [2022-07-21 01:41:53,496 INFO L899 garLoopResultBuilder]: For program point L170-2(lines 144 244) no Hoare annotation was computed. [2022-07-21 01:41:53,496 INFO L895 garLoopResultBuilder]: At program point L220(line 220) the Hoare annotation is: false [2022-07-21 01:41:53,497 INFO L899 garLoopResultBuilder]: For program point L187(lines 187 196) no Hoare annotation was computed. [2022-07-21 01:41:53,497 INFO L895 garLoopResultBuilder]: At program point L220-1(line 220) the Hoare annotation is: false [2022-07-21 01:41:53,497 INFO L899 garLoopResultBuilder]: For program point L220-2(line 220) no Hoare annotation was computed. [2022-07-21 01:41:53,497 INFO L899 garLoopResultBuilder]: For program point L171(lines 171 179) no Hoare annotation was computed. [2022-07-21 01:41:53,497 INFO L899 garLoopResultBuilder]: For program point L221(lines 221 243) no Hoare annotation was computed. [2022-07-21 01:41:53,497 INFO L899 garLoopResultBuilder]: For program point L188(line 188) no Hoare annotation was computed. [2022-07-21 01:41:53,497 INFO L899 garLoopResultBuilder]: For program point L205(line 205) no Hoare annotation was computed. [2022-07-21 01:41:53,498 INFO L899 garLoopResultBuilder]: For program point L172(line 172) no Hoare annotation was computed. [2022-07-21 01:41:53,498 INFO L899 garLoopResultBuilder]: For program point L172-2(line 172) no Hoare annotation was computed. [2022-07-21 01:41:53,498 INFO L899 garLoopResultBuilder]: For program point L222(line 222) no Hoare annotation was computed. [2022-07-21 01:41:53,498 INFO L899 garLoopResultBuilder]: For program point L156-1(lines 156 161) no Hoare annotation was computed. [2022-07-21 01:41:53,498 INFO L895 garLoopResultBuilder]: At program point L156-2(lines 156 161) the Hoare annotation is: (and (= ((_ to_fp 11 53) currentRoundingMode (/ 1.0 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0)) ~tiny_atan2~0) (fp.lt |ULTIMATE.start___ieee754_atan2_~y#1| (_ +zero 11 53)) (exists ((|v_skolemized_q#valueAsBitvector_72| (_ BitVec 64))) (and (= ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_72|) |ULTIMATE.start___ieee754_atan2_~lx~0#1|) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_72|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_72|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_72|)) (fp.neg (_ +zero 11 53))) (= |ULTIMATE.start___ieee754_atan2_~ix~1#1| (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_72|))))) (= ~pi_o_2~0 ((_ to_fp 11 53) currentRoundingMode (/ 785398163397448279.0 500000000000000000.0))) (= currentRoundingMode roundNearestTiesToEven) (exists ((|v_skolemized_q#valueAsBitvector_78| (_ BitVec 64))) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_78|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_78|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_78|)) (fp.neg (_ +zero 11 53))) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_78|) |ULTIMATE.start___ieee754_atan2_~hx~1#1|))) (exists ((|v_skolemized_q#valueAsBitvector_23| (_ BitVec 64)) (|v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_6| (_ BitVec 32))) (let ((.cse0 (select (select |#memory_int| |v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_6|) (_ bv4 32)))) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_23|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_23|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_23|)) (fp.neg (_ +zero 11 53))) (= .cse0 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_23|)) (= |ULTIMATE.start___ieee754_atan2_~ix~1#1| (bvand (_ bv2147483647 32) .cse0)))))) [2022-07-21 01:41:53,498 INFO L899 garLoopResultBuilder]: For program point L156-3(lines 156 161) no Hoare annotation was computed. [2022-07-21 01:41:53,498 INFO L899 garLoopResultBuilder]: For program point L239(line 239) no Hoare annotation was computed. [2022-07-21 01:41:53,498 INFO L899 garLoopResultBuilder]: For program point L173(line 173) no Hoare annotation was computed. [2022-07-21 01:41:53,499 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-21 01:41:53,499 INFO L899 garLoopResultBuilder]: For program point L256(lines 256 265) no Hoare annotation was computed. [2022-07-21 01:41:53,499 INFO L899 garLoopResultBuilder]: For program point L190(line 190) no Hoare annotation was computed. [2022-07-21 01:41:53,499 INFO L899 garLoopResultBuilder]: For program point L256-2(lines 256 265) no Hoare annotation was computed. [2022-07-21 01:41:53,499 INFO L899 garLoopResultBuilder]: For program point L224(line 224) no Hoare annotation was computed. [2022-07-21 01:41:53,499 INFO L899 garLoopResultBuilder]: For program point L241(line 241) no Hoare annotation was computed. [2022-07-21 01:41:53,499 INFO L899 garLoopResultBuilder]: For program point L175(line 175) no Hoare annotation was computed. [2022-07-21 01:41:53,499 INFO L899 garLoopResultBuilder]: For program point L192(line 192) no Hoare annotation was computed. [2022-07-21 01:41:53,499 INFO L899 garLoopResultBuilder]: For program point L226-1(lines 226 230) no Hoare annotation was computed. [2022-07-21 01:41:53,499 INFO L895 garLoopResultBuilder]: At program point L226-2(lines 226 230) the Hoare annotation is: false [2022-07-21 01:41:53,499 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-21 01:41:53,499 INFO L899 garLoopResultBuilder]: For program point L177(line 177) no Hoare annotation was computed. [2022-07-21 01:41:53,499 INFO L895 garLoopResultBuilder]: At program point L144(lines 144 244) the Hoare annotation is: (and (= ((_ to_fp 11 53) currentRoundingMode (/ 1.0 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0)) ~tiny_atan2~0) (= ~pi_o_2~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 785398163397448279.0 500000000000000000.0))) (= currentRoundingMode roundNearestTiesToEven) (= |ULTIMATE.start___ieee754_atan2_#res#1| (fp.sub roundNearestTiesToEven (fp.neg ~pi_o_2~0) ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0))))) [2022-07-21 01:41:53,499 INFO L899 garLoopResultBuilder]: For program point L194(line 194) no Hoare annotation was computed. [2022-07-21 01:41:53,499 INFO L899 garLoopResultBuilder]: For program point L261(lines 261 264) no Hoare annotation was computed. [2022-07-21 01:41:53,500 INFO L899 garLoopResultBuilder]: For program point L212(line 212) no Hoare annotation was computed. [2022-07-21 01:41:53,500 INFO L899 garLoopResultBuilder]: For program point L212-2(line 212) no Hoare annotation was computed. [2022-07-21 01:41:53,500 INFO L899 garLoopResultBuilder]: For program point L262(line 262) no Hoare annotation was computed. [2022-07-21 01:41:53,500 INFO L899 garLoopResultBuilder]: For program point L163(lines 163 165) no Hoare annotation was computed. [2022-07-21 01:41:53,500 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-21 01:41:53,500 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 262) no Hoare annotation was computed. [2022-07-21 01:41:53,500 INFO L899 garLoopResultBuilder]: For program point L231(lines 231 236) no Hoare annotation was computed. [2022-07-21 01:41:53,500 INFO L899 garLoopResultBuilder]: For program point L198(lines 198 207) no Hoare annotation was computed. [2022-07-21 01:41:53,500 INFO L899 garLoopResultBuilder]: For program point L231-1(lines 224 237) no Hoare annotation was computed. [2022-07-21 01:41:53,500 INFO L899 garLoopResultBuilder]: For program point L231-2(lines 231 236) no Hoare annotation was computed. [2022-07-21 01:41:53,501 INFO L899 garLoopResultBuilder]: For program point L215(lines 215 220) no Hoare annotation was computed. [2022-07-21 01:41:53,501 INFO L899 garLoopResultBuilder]: For program point L149-1(lines 149 154) no Hoare annotation was computed. [2022-07-21 01:41:53,501 INFO L895 garLoopResultBuilder]: At program point L149-2(lines 149 154) the Hoare annotation is: (let ((.cse0 (fp.neg (_ +zero 11 53)))) (and (= ((_ to_fp 11 53) currentRoundingMode (/ 1.0 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0)) ~tiny_atan2~0) (fp.lt |ULTIMATE.start___ieee754_atan2_~y#1| (_ +zero 11 53)) (= ~pi_o_2~0 ((_ to_fp 11 53) currentRoundingMode (/ 785398163397448279.0 500000000000000000.0))) (= .cse0 |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start___ieee754_atan2_~x#1| .cse0) (= currentRoundingMode roundNearestTiesToEven))) [2022-07-21 01:41:53,501 INFO L899 garLoopResultBuilder]: For program point L149-3(lines 149 154) no Hoare annotation was computed. [2022-07-21 01:41:53,501 INFO L899 garLoopResultBuilder]: For program point L199(line 199) no Hoare annotation was computed. [2022-07-21 01:41:53,501 INFO L899 garLoopResultBuilder]: For program point L166(lines 166 167) no Hoare annotation was computed. [2022-07-21 01:41:53,501 INFO L899 garLoopResultBuilder]: For program point L183(line 183) no Hoare annotation was computed. [2022-07-21 01:41:53,502 INFO L899 garLoopResultBuilder]: For program point L183-2(line 183) no Hoare annotation was computed. [2022-07-21 01:41:53,502 INFO L895 garLoopResultBuilder]: At program point L167(line 167) the Hoare annotation is: false [2022-07-21 01:41:53,502 INFO L899 garLoopResultBuilder]: For program point L167-1(line 167) no Hoare annotation was computed. [2022-07-21 01:41:53,505 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 01:41:53,507 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-21 01:41:53,515 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:41:53,521 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:41:53,523 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_72,QUANTIFIED] [2022-07-21 01:41:53,524 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_72,QUANTIFIED] [2022-07-21 01:41:53,524 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_72,QUANTIFIED] [2022-07-21 01:41:53,524 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_72,QUANTIFIED] [2022-07-21 01:41:53,524 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_72,QUANTIFIED] [2022-07-21 01:41:53,525 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:41:53,525 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_78,QUANTIFIED] [2022-07-21 01:41:53,525 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_78,QUANTIFIED] [2022-07-21 01:41:53,525 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_78,QUANTIFIED] [2022-07-21 01:41:53,525 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_78,QUANTIFIED] [2022-07-21 01:41:53,525 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_23,QUANTIFIED] [2022-07-21 01:41:53,526 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_23,QUANTIFIED] [2022-07-21 01:41:53,526 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_23,QUANTIFIED] [2022-07-21 01:41:53,526 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_6,QUANTIFIED] [2022-07-21 01:41:53,526 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_23,QUANTIFIED] [2022-07-21 01:41:53,526 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_6,QUANTIFIED] [2022-07-21 01:41:53,527 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_72,QUANTIFIED] [2022-07-21 01:41:53,528 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_72,QUANTIFIED] [2022-07-21 01:41:53,528 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_72,QUANTIFIED] [2022-07-21 01:41:53,528 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_72,QUANTIFIED] [2022-07-21 01:41:53,528 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_72,QUANTIFIED] [2022-07-21 01:41:53,528 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:41:53,529 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_78,QUANTIFIED] [2022-07-21 01:41:53,529 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_78,QUANTIFIED] [2022-07-21 01:41:53,529 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_78,QUANTIFIED] [2022-07-21 01:41:53,529 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_78,QUANTIFIED] [2022-07-21 01:41:53,529 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_23,QUANTIFIED] [2022-07-21 01:41:53,529 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_23,QUANTIFIED] [2022-07-21 01:41:53,530 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_23,QUANTIFIED] [2022-07-21 01:41:53,530 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_6,QUANTIFIED] [2022-07-21 01:41:53,530 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_23,QUANTIFIED] [2022-07-21 01:41:53,530 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_6,QUANTIFIED] [2022-07-21 01:41:53,531 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:41:53,532 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:41:53,532 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:41:53,532 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:41:53,533 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:41:53,533 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:41:53,533 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:41:53,533 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:41:53,534 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.07 01:41:53 BoogieIcfgContainer [2022-07-21 01:41:53,534 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-21 01:41:53,535 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-21 01:41:53,535 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-21 01:41:53,535 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-21 01:41:53,536 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 01:37:50" (3/4) ... [2022-07-21 01:41:53,539 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-21 01:41:53,544 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fabs_double [2022-07-21 01:41:53,545 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure atan_double [2022-07-21 01:41:53,553 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 29 nodes and edges [2022-07-21 01:41:53,554 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2022-07-21 01:41:53,554 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-07-21 01:41:53,554 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-21 01:41:53,577 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) == tiny_atan2 && ~fp.lt~DOUBLE(y, ~Pluszero~LONGDOUBLE())) && (\exists v_skolemized_q#valueAsBitvector_72 : bv64 :: (v_skolemized_q#valueAsBitvector_72[31:0] == lx && ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_72[63:63], v_skolemized_q#valueAsBitvector_72[62:52], v_skolemized_q#valueAsBitvector_72[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && ix == ~bvand32(2147483647bv32, v_skolemized_q#valueAsBitvector_72[63:32]))) && pi_o_2 == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 785398163397448279/500000000000000000)) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) && (\exists v_skolemized_q#valueAsBitvector_78 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_78[63:63], v_skolemized_q#valueAsBitvector_78[62:52], v_skolemized_q#valueAsBitvector_78[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && v_skolemized_q#valueAsBitvector_78[63:32] == hx)) && (\exists v_skolemized_q#valueAsBitvector_23 : bv64, v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_6 : bv32 :: (~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_23[63:63], v_skolemized_q#valueAsBitvector_23[62:52], v_skolemized_q#valueAsBitvector_23[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_6][4bv32] == v_skolemized_q#valueAsBitvector_23[63:32]) && ix == ~bvand32(2147483647bv32, unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_6][4bv32])) [2022-07-21 01:41:53,578 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) == tiny_atan2 && pi_o_2 == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 785398163397448279/500000000000000000)) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) && \result == ~fp.sub~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(pi_o_2), ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000)) [2022-07-21 01:41:53,623 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-21 01:41:53,623 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-21 01:41:53,624 INFO L158 Benchmark]: Toolchain (without parser) took 264757.89ms. Allocated memory was 67.1MB in the beginning and 81.8MB in the end (delta: 14.7MB). Free memory was 47.0MB in the beginning and 27.0MB in the end (delta: 20.0MB). Peak memory consumption was 35.5MB. Max. memory is 16.1GB. [2022-07-21 01:41:53,624 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 67.1MB. Free memory was 47.6MB in the beginning and 47.5MB in the end (delta: 29.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 01:41:53,625 INFO L158 Benchmark]: CACSL2BoogieTranslator took 475.00ms. Allocated memory is still 67.1MB. Free memory was 46.8MB in the beginning and 45.4MB in the end (delta: 1.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-21 01:41:53,627 INFO L158 Benchmark]: Boogie Procedure Inliner took 76.67ms. Allocated memory is still 67.1MB. Free memory was 45.4MB in the beginning and 43.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-21 01:41:53,628 INFO L158 Benchmark]: Boogie Preprocessor took 69.98ms. Allocated memory is still 67.1MB. Free memory was 43.0MB in the beginning and 40.2MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-21 01:41:53,628 INFO L158 Benchmark]: RCFGBuilder took 20806.88ms. Allocated memory is still 67.1MB. Free memory was 40.2MB in the beginning and 29.5MB in the end (delta: 10.7MB). Peak memory consumption was 15.6MB. Max. memory is 16.1GB. [2022-07-21 01:41:53,630 INFO L158 Benchmark]: TraceAbstraction took 243233.34ms. Allocated memory was 67.1MB in the beginning and 81.8MB in the end (delta: 14.7MB). Free memory was 28.9MB in the beginning and 32.6MB in the end (delta: -3.7MB). Peak memory consumption was 10.8MB. Max. memory is 16.1GB. [2022-07-21 01:41:53,631 INFO L158 Benchmark]: Witness Printer took 88.54ms. Allocated memory is still 81.8MB. Free memory was 32.6MB in the beginning and 27.0MB in the end (delta: 5.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-21 01:41:53,633 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.31ms. Allocated memory is still 67.1MB. Free memory was 47.6MB in the beginning and 47.5MB in the end (delta: 29.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 475.00ms. Allocated memory is still 67.1MB. Free memory was 46.8MB in the beginning and 45.4MB in the end (delta: 1.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 76.67ms. Allocated memory is still 67.1MB. Free memory was 45.4MB in the beginning and 43.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 69.98ms. Allocated memory is still 67.1MB. Free memory was 43.0MB in the beginning and 40.2MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 20806.88ms. Allocated memory is still 67.1MB. Free memory was 40.2MB in the beginning and 29.5MB in the end (delta: 10.7MB). Peak memory consumption was 15.6MB. Max. memory is 16.1GB. * TraceAbstraction took 243233.34ms. Allocated memory was 67.1MB in the beginning and 81.8MB in the end (delta: 14.7MB). Free memory was 28.9MB in the beginning and 32.6MB in the end (delta: -3.7MB). Peak memory consumption was 10.8MB. Max. memory is 16.1GB. * Witness Printer took 88.54ms. Allocated memory is still 81.8MB. Free memory was 32.6MB in the beginning and 27.0MB in the end (delta: 5.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_72,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_72,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_72,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_72,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_72,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_78,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_78,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_78,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_78,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_72,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_72,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_72,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_72,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_72,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_78,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_78,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_78,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_78,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation 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 * 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: 262]: 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, 94 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 243.1s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 155.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 35 mSolverCounterUnknown, 412 SdHoareTripleChecker+Valid, 133.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 392 mSDsluCounter, 6194 SdHoareTripleChecker+Invalid, 126.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 293 IncrementalHoareTripleChecker+Unchecked, 4811 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 281 IncrementalHoareTripleChecker+Invalid, 616 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 1383 mSDtfsCounter, 281 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 300 GetRequests, 205 SyntacticMatches, 3 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 59.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=94occurred in iteration=0, InterpolantAutomatonStates: 103, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 69 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 58 PreInvPairs, 62 NumberOfFragments, 143 HoareAnnotationTreeSize, 58 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 14 FomulaSimplificationsInter, 120 FormulaSimplificationTreeSizeReductionInter, 2.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 4.6s SatisfiabilityAnalysisTime, 75.9s InterpolantComputationTime, 288 NumberOfCodeBlocks, 288 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 273 ConstructedInterpolants, 110 QuantifiedInterpolants, 3333 SizeOfPredicates, 104 NumberOfNonLiveVariables, 2166 ConjunctsInSsa, 178 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 149]: Loop Invariant [2022-07-21 01:41:53,650 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:41:53,651 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ((((~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) == tiny_atan2 && ~fp.lt~DOUBLE(y, ~Pluszero~LONGDOUBLE())) && pi_o_2 == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 785398163397448279/500000000000000000)) && ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == x) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven - InvariantResult [Line: 78]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 156]: Loop Invariant [2022-07-21 01:41:53,651 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_72,QUANTIFIED] [2022-07-21 01:41:53,652 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_72,QUANTIFIED] [2022-07-21 01:41:53,652 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_72,QUANTIFIED] [2022-07-21 01:41:53,652 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_72,QUANTIFIED] [2022-07-21 01:41:53,652 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_72,QUANTIFIED] [2022-07-21 01:41:53,652 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:41:53,652 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_78,QUANTIFIED] [2022-07-21 01:41:53,652 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_78,QUANTIFIED] [2022-07-21 01:41:53,653 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_78,QUANTIFIED] [2022-07-21 01:41:53,653 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_78,QUANTIFIED] [2022-07-21 01:41:53,653 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_23,QUANTIFIED] [2022-07-21 01:41:53,653 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_23,QUANTIFIED] [2022-07-21 01:41:53,653 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_23,QUANTIFIED] [2022-07-21 01:41:53,653 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_6,QUANTIFIED] [2022-07-21 01:41:53,654 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_23,QUANTIFIED] [2022-07-21 01:41:53,654 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_6,QUANTIFIED] [2022-07-21 01:41:53,654 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_72,QUANTIFIED] [2022-07-21 01:41:53,655 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_72,QUANTIFIED] [2022-07-21 01:41:53,655 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_72,QUANTIFIED] [2022-07-21 01:41:53,655 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_72,QUANTIFIED] [2022-07-21 01:41:53,655 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_72,QUANTIFIED] [2022-07-21 01:41:53,655 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:41:53,655 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_78,QUANTIFIED] [2022-07-21 01:41:53,656 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_78,QUANTIFIED] [2022-07-21 01:41:53,656 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_78,QUANTIFIED] [2022-07-21 01:41:53,656 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_78,QUANTIFIED] [2022-07-21 01:41:53,656 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_23,QUANTIFIED] [2022-07-21 01:41:53,656 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_23,QUANTIFIED] [2022-07-21 01:41:53,656 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_23,QUANTIFIED] [2022-07-21 01:41:53,656 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_6,QUANTIFIED] [2022-07-21 01:41:53,657 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_23,QUANTIFIED] [2022-07-21 01:41:53,657 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_6,QUANTIFIED] Derived loop invariant: (((((~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) == tiny_atan2 && ~fp.lt~DOUBLE(y, ~Pluszero~LONGDOUBLE())) && (\exists v_skolemized_q#valueAsBitvector_72 : bv64 :: (v_skolemized_q#valueAsBitvector_72[31:0] == lx && ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_72[63:63], v_skolemized_q#valueAsBitvector_72[62:52], v_skolemized_q#valueAsBitvector_72[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && ix == ~bvand32(2147483647bv32, v_skolemized_q#valueAsBitvector_72[63:32]))) && pi_o_2 == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 785398163397448279/500000000000000000)) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) && (\exists v_skolemized_q#valueAsBitvector_78 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_78[63:63], v_skolemized_q#valueAsBitvector_78[62:52], v_skolemized_q#valueAsBitvector_78[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && v_skolemized_q#valueAsBitvector_78[63:32] == hx)) && (\exists v_skolemized_q#valueAsBitvector_23 : bv64, v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_6 : bv32 :: (~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_23[63:63], v_skolemized_q#valueAsBitvector_23[62:52], v_skolemized_q#valueAsBitvector_23[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_6][4bv32] == v_skolemized_q#valueAsBitvector_23[63:32]) && ix == ~bvand32(2147483647bv32, unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_6][4bv32])) - InvariantResult [Line: 226]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 70]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 144]: Loop Invariant [2022-07-21 01:41:53,658 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:41:53,658 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:41:53,658 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:41:53,658 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:41:53,659 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:41:53,659 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:41:53,659 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:41:53,659 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ((~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) == tiny_atan2 && pi_o_2 == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 785398163397448279/500000000000000000)) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) && \result == ~fp.sub~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(pi_o_2), ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000)) - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 246]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-07-21 01:41:53,875 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2022-07-21 01:41:53,966 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE