./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/double_req_bl_0685b.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/double_req_bl_0685b.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 63c75cb1914098e0a99942bfcf64a7e270bd0424176714d202a2c3dfb2438929 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 02:56:49,662 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 02:56:49,665 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 02:56:49,702 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 02:56:49,703 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 02:56:49,704 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 02:56:49,705 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 02:56:49,708 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 02:56:49,712 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 02:56:49,713 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 02:56:49,714 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 02:56:49,716 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 02:56:49,717 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 02:56:49,720 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 02:56:49,721 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 02:56:49,723 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 02:56:49,724 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 02:56:49,730 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 02:56:49,732 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 02:56:49,733 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 02:56:49,735 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 02:56:49,744 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 02:56:49,745 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 02:56:49,746 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 02:56:49,747 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 02:56:49,749 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 02:56:49,749 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 02:56:49,750 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 02:56:49,750 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 02:56:49,751 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 02:56:49,755 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 02:56:49,755 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 02:56:49,756 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 02:56:49,757 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 02:56:49,757 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 02:56:49,759 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 02:56:49,759 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 02:56:49,760 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 02:56:49,761 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 02:56:49,761 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 02:56:49,761 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 02:56:49,763 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 02:56:49,764 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-12 02:56:49,795 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 02:56:49,795 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 02:56:49,796 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 02:56:49,796 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 02:56:49,797 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 02:56:49,797 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 02:56:49,797 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 02:56:49,798 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 02:56:49,798 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 02:56:49,799 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 02:56:49,799 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 02:56:49,799 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 02:56:49,799 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 02:56:49,799 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 02:56:49,800 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 02:56:49,800 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 02:56:49,800 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 02:56:49,800 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 02:56:49,800 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 02:56:49,801 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 02:56:49,801 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 02:56:49,801 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 02:56:49,801 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 02:56:49,801 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 02:56:49,801 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 02:56:49,802 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 02:56:49,802 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 02:56:49,802 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 02:56:49,802 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 02:56:49,802 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 02:56:49,803 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 02:56:49,803 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 02:56:49,803 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 02:56:49,803 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 -> 63c75cb1914098e0a99942bfcf64a7e270bd0424176714d202a2c3dfb2438929 [2022-07-12 02:56:50,092 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 02:56:50,114 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 02:56:50,117 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 02:56:50,118 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 02:56:50,119 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 02:56:50,121 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_0685b.c [2022-07-12 02:56:50,185 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e34e7e10/9f71d7693f1a4d7698785d45f151affb/FLAG07d2f8b1d [2022-07-12 02:56:50,629 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 02:56:50,629 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_0685b.c [2022-07-12 02:56:50,648 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e34e7e10/9f71d7693f1a4d7698785d45f151affb/FLAG07d2f8b1d [2022-07-12 02:56:51,149 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e34e7e10/9f71d7693f1a4d7698785d45f151affb [2022-07-12 02:56:51,152 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 02:56:51,153 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 02:56:51,155 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 02:56:51,157 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 02:56:51,159 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 02:56:51,160 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 02:56:51" (1/1) ... [2022-07-12 02:56:51,160 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@170ca43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:56:51, skipping insertion in model container [2022-07-12 02:56:51,163 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 02:56:51" (1/1) ... [2022-07-12 02:56:51,169 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 02:56:51,199 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 02:56:51,431 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_0685b.c[6216,6229] [2022-07-12 02:56:51,434 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 02:56:51,442 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 02:56:51,493 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_0685b.c[6216,6229] [2022-07-12 02:56:51,493 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 02:56:51,508 INFO L208 MainTranslator]: Completed translation [2022-07-12 02:56:51,509 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:56:51 WrapperNode [2022-07-12 02:56:51,509 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 02:56:51,510 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 02:56:51,510 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 02:56:51,511 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 02:56:51,517 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:56:51" (1/1) ... [2022-07-12 02:56:51,555 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:56:51" (1/1) ... [2022-07-12 02:56:51,627 INFO L137 Inliner]: procedures = 19, calls = 87, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 261 [2022-07-12 02:56:51,628 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 02:56:51,629 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 02:56:51,630 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 02:56:51,630 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 02:56:51,637 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:56:51" (1/1) ... [2022-07-12 02:56:51,638 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:56:51" (1/1) ... [2022-07-12 02:56:51,657 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:56:51" (1/1) ... [2022-07-12 02:56:51,658 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:56:51" (1/1) ... [2022-07-12 02:56:51,678 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:56:51" (1/1) ... [2022-07-12 02:56:51,691 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:56:51" (1/1) ... [2022-07-12 02:56:51,703 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:56:51" (1/1) ... [2022-07-12 02:56:51,708 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 02:56:51,715 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 02:56:51,715 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 02:56:51,715 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 02:56:51,717 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:56:51" (1/1) ... [2022-07-12 02:56:51,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 02:56:51,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 02:56:51,753 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-12 02:56:51,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-12 02:56:51,793 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 02:56:51,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 02:56:51,793 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 02:56:51,793 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-07-12 02:56:51,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 02:56:51,794 INFO L130 BoogieDeclarations]: Found specification of procedure fabs_double [2022-07-12 02:56:51,794 INFO L138 BoogieDeclarations]: Found implementation of procedure fabs_double [2022-07-12 02:56:51,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-07-12 02:56:51,794 INFO L130 BoogieDeclarations]: Found specification of procedure atan_double [2022-07-12 02:56:51,794 INFO L138 BoogieDeclarations]: Found implementation of procedure atan_double [2022-07-12 02:56:51,795 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 02:56:51,795 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 02:56:51,795 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 02:56:51,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2022-07-12 02:56:51,795 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 02:56:51,896 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 02:56:51,897 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 02:56:52,377 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 02:56:52,392 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 02:56:52,392 INFO L299 CfgBuilder]: Removed 16 assume(true) statements. [2022-07-12 02:56:52,395 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 02:56:52 BoogieIcfgContainer [2022-07-12 02:56:52,395 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 02:56:52,398 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 02:56:52,398 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 02:56:52,401 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 02:56:52,402 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 02:56:51" (1/3) ... [2022-07-12 02:56:52,403 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@292b3d76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 02:56:52, skipping insertion in model container [2022-07-12 02:56:52,403 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:56:51" (2/3) ... [2022-07-12 02:56:52,403 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@292b3d76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 02:56:52, skipping insertion in model container [2022-07-12 02:56:52,403 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 02:56:52" (3/3) ... [2022-07-12 02:56:52,405 INFO L111 eAbstractionObserver]: Analyzing ICFG double_req_bl_0685b.c [2022-07-12 02:56:52,418 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 02:56:52,419 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 02:56:52,486 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 02:56:52,493 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@2648d4eb, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@12b25504 [2022-07-12 02:56:52,493 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 02:56:52,498 INFO L276 IsEmpty]: Start isEmpty. Operand has 105 states, 97 states have (on average 1.7422680412371134) internal successors, (169), 98 states have internal predecessors, (169), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-12 02:56:52,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-12 02:56:52,504 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 02:56:52,505 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 02:56:52,505 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 02:56:52,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 02:56:52,510 INFO L85 PathProgramCache]: Analyzing trace with hash -8232233, now seen corresponding path program 1 times [2022-07-12 02:56:52,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 02:56:52,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107112430] [2022-07-12 02:56:52,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 02:56:52,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 02:56:52,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 02:56:52,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 02:56:52,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 02:56:52,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107112430] [2022-07-12 02:56:52,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107112430] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 02:56:52,702 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 02:56:52,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 02:56:52,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462234710] [2022-07-12 02:56:52,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 02:56:52,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-12 02:56:52,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 02:56:52,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-12 02:56:52,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 02:56:52,762 INFO L87 Difference]: Start difference. First operand has 105 states, 97 states have (on average 1.7422680412371134) internal successors, (169), 98 states have internal predecessors, (169), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:56:52,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 02:56:52,803 INFO L93 Difference]: Finished difference Result 208 states and 356 transitions. [2022-07-12 02:56:52,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-12 02:56:52,806 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-07-12 02:56:52,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 02:56:52,813 INFO L225 Difference]: With dead ends: 208 [2022-07-12 02:56:52,813 INFO L226 Difference]: Without dead ends: 102 [2022-07-12 02:56:52,816 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 02:56:52,819 INFO L413 NwaCegarLoop]: 154 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, 154 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 02:56:52,819 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 02:56:52,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-07-12 02:56:52,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2022-07-12 02:56:52,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 95 states have (on average 1.5052631578947369) internal successors, (143), 95 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-12 02:56:52,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 151 transitions. [2022-07-12 02:56:52,856 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 151 transitions. Word has length 10 [2022-07-12 02:56:52,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 02:56:52,857 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 151 transitions. [2022-07-12 02:56:52,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:56:52,857 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 151 transitions. [2022-07-12 02:56:52,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-12 02:56:52,859 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 02:56:52,859 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 02:56:52,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 02:56:52,860 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 02:56:52,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 02:56:52,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1919635121, now seen corresponding path program 1 times [2022-07-12 02:56:52,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 02:56:52,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112927407] [2022-07-12 02:56:52,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 02:56:52,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 02:56:53,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 02:56:53,079 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-12 02:56:53,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 02:56:53,234 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-12 02:56:53,235 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-12 02:56:53,239 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-12 02:56:53,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 02:56:53,260 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1] [2022-07-12 02:56:53,263 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-12 02:56:53,318 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.07 02:56:53 BoogieIcfgContainer [2022-07-12 02:56:53,319 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-12 02:56:53,320 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-12 02:56:53,320 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-12 02:56:53,320 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-12 02:56:53,331 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 02:56:52" (3/4) ... [2022-07-12 02:56:53,335 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-12 02:56:53,336 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-12 02:56:53,336 INFO L158 Benchmark]: Toolchain (without parser) took 2183.16ms. Allocated memory is still 109.1MB. Free memory was 70.5MB in the beginning and 52.2MB in the end (delta: 18.3MB). Peak memory consumption was 21.6MB. Max. memory is 16.1GB. [2022-07-12 02:56:53,337 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 109.1MB. Free memory is still 88.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 02:56:53,337 INFO L158 Benchmark]: CACSL2BoogieTranslator took 354.27ms. Allocated memory is still 109.1MB. Free memory was 70.3MB in the beginning and 56.0MB in the end (delta: 14.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-07-12 02:56:53,338 INFO L158 Benchmark]: Boogie Procedure Inliner took 117.52ms. Allocated memory is still 109.1MB. Free memory was 56.0MB in the beginning and 85.5MB in the end (delta: -29.6MB). Peak memory consumption was 4.4MB. Max. memory is 16.1GB. [2022-07-12 02:56:53,338 INFO L158 Benchmark]: Boogie Preprocessor took 79.08ms. Allocated memory is still 109.1MB. Free memory was 85.2MB in the beginning and 82.0MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-12 02:56:53,339 INFO L158 Benchmark]: RCFGBuilder took 680.27ms. Allocated memory is still 109.1MB. Free memory was 82.0MB in the beginning and 54.7MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-07-12 02:56:53,340 INFO L158 Benchmark]: TraceAbstraction took 921.21ms. Allocated memory is still 109.1MB. Free memory was 54.4MB in the beginning and 52.2MB in the end (delta: 2.2MB). Peak memory consumption was 4.6MB. Max. memory is 16.1GB. [2022-07-12 02:56:53,340 INFO L158 Benchmark]: Witness Printer took 16.25ms. Allocated memory is still 109.1MB. Free memory is still 52.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 02:56:53,343 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.24ms. Allocated memory is still 109.1MB. Free memory is still 88.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 354.27ms. Allocated memory is still 109.1MB. Free memory was 70.3MB in the beginning and 56.0MB in the end (delta: 14.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 117.52ms. Allocated memory is still 109.1MB. Free memory was 56.0MB in the beginning and 85.5MB in the end (delta: -29.6MB). Peak memory consumption was 4.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 79.08ms. Allocated memory is still 109.1MB. Free memory was 85.2MB in the beginning and 82.0MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 680.27ms. Allocated memory is still 109.1MB. Free memory was 82.0MB in the beginning and 54.7MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 921.21ms. Allocated memory is still 109.1MB. Free memory was 54.4MB in the beginning and 52.2MB in the end (delta: 2.2MB). Peak memory consumption was 4.6MB. Max. memory is 16.1GB. * Witness Printer took 16.25ms. Allocated memory is still 109.1MB. Free memory is still 52.2MB. 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: 260]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 164, overapproximation of someUnaryDOUBLEoperation at line 54, overapproximation of someBinaryArithmeticDOUBLEoperation at line 165, overapproximation of someBinaryDOUBLEComparisonOperation at line 259. 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 = -1.0 / 0.0; [L254] double y = -1.0 / 0.0; [L256] 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] [L256] RET, EXPR __ieee754_atan2(y, x) [L256] double res = __ieee754_atan2(y, x); [L259] COND TRUE res != -3 * pi_o_4 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] [L260] 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, 105 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, 154 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, 154 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=105occurred 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, 22 NumberOfCodeBlocks, 22 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 9 ConstructedInterpolants, 0 QuantifiedInterpolants, 9 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-12 02:56:53,407 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_0685b.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 63c75cb1914098e0a99942bfcf64a7e270bd0424176714d202a2c3dfb2438929 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 02:56:55,613 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 02:56:55,617 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 02:56:55,657 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 02:56:55,658 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 02:56:55,660 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 02:56:55,666 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 02:56:55,669 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 02:56:55,672 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 02:56:55,677 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 02:56:55,679 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 02:56:55,682 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 02:56:55,682 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 02:56:55,684 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 02:56:55,686 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 02:56:55,691 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 02:56:55,692 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 02:56:55,694 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 02:56:55,698 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 02:56:55,705 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 02:56:55,707 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 02:56:55,708 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 02:56:55,710 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 02:56:55,711 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 02:56:55,713 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 02:56:55,721 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 02:56:55,721 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 02:56:55,722 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 02:56:55,723 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 02:56:55,723 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 02:56:55,724 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 02:56:55,725 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 02:56:55,727 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 02:56:55,728 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 02:56:55,730 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 02:56:55,731 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 02:56:55,731 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 02:56:55,732 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 02:56:55,732 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 02:56:55,732 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 02:56:55,733 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 02:56:55,735 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 02:56:55,736 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-12 02:56:55,772 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 02:56:55,772 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 02:56:55,773 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 02:56:55,773 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 02:56:55,774 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 02:56:55,774 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 02:56:55,775 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 02:56:55,775 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 02:56:55,775 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 02:56:55,776 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 02:56:55,777 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 02:56:55,777 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 02:56:55,777 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 02:56:55,777 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 02:56:55,777 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 02:56:55,778 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 02:56:55,778 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-12 02:56:55,778 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-12 02:56:55,778 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-12 02:56:55,778 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 02:56:55,778 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 02:56:55,779 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 02:56:55,779 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 02:56:55,779 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 02:56:55,779 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 02:56:55,780 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 02:56:55,780 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 02:56:55,780 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 02:56:55,780 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 02:56:55,780 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 02:56:55,781 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-12 02:56:55,781 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-12 02:56:55,781 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 02:56:55,781 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 02:56:55,782 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 02:56:55,782 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-12 02:56:55,782 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 -> 63c75cb1914098e0a99942bfcf64a7e270bd0424176714d202a2c3dfb2438929 [2022-07-12 02:56:56,116 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 02:56:56,144 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 02:56:56,148 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 02:56:56,149 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 02:56:56,150 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 02:56:56,152 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_0685b.c [2022-07-12 02:56:56,228 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd2ad731f/1ecf63f36f634f34bb41fb14736afe53/FLAG8a7fc989e [2022-07-12 02:56:56,780 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 02:56:56,781 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_0685b.c [2022-07-12 02:56:56,791 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd2ad731f/1ecf63f36f634f34bb41fb14736afe53/FLAG8a7fc989e [2022-07-12 02:56:57,148 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd2ad731f/1ecf63f36f634f34bb41fb14736afe53 [2022-07-12 02:56:57,151 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 02:56:57,152 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 02:56:57,156 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 02:56:57,157 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 02:56:57,162 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 02:56:57,163 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 02:56:57" (1/1) ... [2022-07-12 02:56:57,167 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7709be6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:56:57, skipping insertion in model container [2022-07-12 02:56:57,168 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 02:56:57" (1/1) ... [2022-07-12 02:56:57,179 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 02:56:57,221 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 02:56:57,466 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_0685b.c[6216,6229] [2022-07-12 02:56:57,473 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 02:56:57,488 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 02:56:57,566 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_0685b.c[6216,6229] [2022-07-12 02:56:57,572 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 02:56:57,609 INFO L208 MainTranslator]: Completed translation [2022-07-12 02:56:57,610 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:56:57 WrapperNode [2022-07-12 02:56:57,610 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 02:56:57,612 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 02:56:57,612 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 02:56:57,612 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 02:56:57,619 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:56:57" (1/1) ... [2022-07-12 02:56:57,645 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:56:57" (1/1) ... [2022-07-12 02:56:57,684 INFO L137 Inliner]: procedures = 22, calls = 87, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 226 [2022-07-12 02:56:57,685 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 02:56:57,686 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 02:56:57,686 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 02:56:57,686 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 02:56:57,698 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:56:57" (1/1) ... [2022-07-12 02:56:57,698 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:56:57" (1/1) ... [2022-07-12 02:56:57,716 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:56:57" (1/1) ... [2022-07-12 02:56:57,720 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:56:57" (1/1) ... [2022-07-12 02:56:57,740 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:56:57" (1/1) ... [2022-07-12 02:56:57,745 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:56:57" (1/1) ... [2022-07-12 02:56:57,751 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:56:57" (1/1) ... [2022-07-12 02:56:57,756 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 02:56:57,758 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 02:56:57,763 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 02:56:57,763 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 02:56:57,764 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:56:57" (1/1) ... [2022-07-12 02:56:57,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 02:56:57,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 02:56:57,805 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-12 02:56:57,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-12 02:56:57,853 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 02:56:57,854 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2022-07-12 02:56:57,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2022-07-12 02:56:57,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-12 02:56:57,855 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 02:56:57,856 INFO L130 BoogieDeclarations]: Found specification of procedure fabs_double [2022-07-12 02:56:57,856 INFO L138 BoogieDeclarations]: Found implementation of procedure fabs_double [2022-07-12 02:56:57,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8 [2022-07-12 02:56:57,856 INFO L130 BoogieDeclarations]: Found specification of procedure atan_double [2022-07-12 02:56:57,856 INFO L138 BoogieDeclarations]: Found implementation of procedure atan_double [2022-07-12 02:56:57,856 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-12 02:56:57,857 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 02:56:57,857 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 02:56:57,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-12 02:56:57,857 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 02:56:58,007 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 02:56:58,024 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 02:57:21,227 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 02:57:21,233 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 02:57:21,234 INFO L299 CfgBuilder]: Removed 16 assume(true) statements. [2022-07-12 02:57:21,244 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 02:57:21 BoogieIcfgContainer [2022-07-12 02:57:21,244 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 02:57:21,246 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 02:57:21,246 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 02:57:21,249 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 02:57:21,249 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 02:56:57" (1/3) ... [2022-07-12 02:57:21,250 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33fd9b91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 02:57:21, skipping insertion in model container [2022-07-12 02:57:21,250 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:56:57" (2/3) ... [2022-07-12 02:57:21,251 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33fd9b91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 02:57:21, skipping insertion in model container [2022-07-12 02:57:21,251 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 02:57:21" (3/3) ... [2022-07-12 02:57:21,257 INFO L111 eAbstractionObserver]: Analyzing ICFG double_req_bl_0685b.c [2022-07-12 02:57:21,273 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 02:57:21,273 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 02:57:21,354 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 02:57:21,365 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@e7d2f5a, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@bca4136 [2022-07-12 02:57:21,366 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 02:57:21,371 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 84 states have (on average 1.6666666666666667) internal successors, (140), 85 states have internal predecessors, (140), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-12 02:57:21,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-12 02:57:21,378 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 02:57:21,379 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 02:57:21,380 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 02:57:21,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 02:57:21,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1713470270, now seen corresponding path program 1 times [2022-07-12 02:57:21,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 02:57:21,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1248721745] [2022-07-12 02:57:21,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 02:57:21,405 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 02:57:21,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 02:57:21,411 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 02:57:21,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-12 02:57:21,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 02:57:21,933 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-12 02:57:21,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 02:57:21,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 02:57:21,965 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 02:57:21,966 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 02:57:21,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1248721745] [2022-07-12 02:57:21,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1248721745] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 02:57:21,967 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 02:57:21,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 02:57:21,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857568749] [2022-07-12 02:57:21,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 02:57:21,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-12 02:57:21,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 02:57:22,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-12 02:57:22,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 02:57:22,005 INFO L87 Difference]: Start difference. First operand has 92 states, 84 states have (on average 1.6666666666666667) internal successors, (140), 85 states have internal predecessors, (140), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:57:22,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 02:57:22,033 INFO L93 Difference]: Finished difference Result 182 states and 298 transitions. [2022-07-12 02:57:22,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-12 02:57:22,036 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-07-12 02:57:22,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 02:57:22,043 INFO L225 Difference]: With dead ends: 182 [2022-07-12 02:57:22,044 INFO L226 Difference]: Without dead ends: 89 [2022-07-12 02:57:22,048 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 02:57:22,051 INFO L413 NwaCegarLoop]: 131 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, 131 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 02:57:22,053 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 02:57:22,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-07-12 02:57:22,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2022-07-12 02:57:22,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 82 states have (on average 1.4634146341463414) internal successors, (120), 82 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-12 02:57:22,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 128 transitions. [2022-07-12 02:57:22,094 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 128 transitions. Word has length 10 [2022-07-12 02:57:22,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 02:57:22,095 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 128 transitions. [2022-07-12 02:57:22,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:57:22,095 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 128 transitions. [2022-07-12 02:57:22,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-12 02:57:22,096 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 02:57:22,096 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 02:57:22,121 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-12 02:57:22,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 02:57:22,311 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 02:57:22,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 02:57:22,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1701355047, now seen corresponding path program 1 times [2022-07-12 02:57:22,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 02:57:22,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [154047172] [2022-07-12 02:57:22,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 02:57:22,313 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 02:57:22,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 02:57:22,315 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 02:57:22,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-12 02:57:22,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 02:57:22,988 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-12 02:57:23,024 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 02:57:23,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 02:57:23,767 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-07-12 02:57:25,927 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 02:57:25,928 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 17 [2022-07-12 02:57:28,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 02:57:28,232 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 02:57:28,233 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 02:57:28,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [154047172] [2022-07-12 02:57:28,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [154047172] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 02:57:28,233 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 02:57:28,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 02:57:28,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852051716] [2022-07-12 02:57:28,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 02:57:28,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 02:57:28,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 02:57:28,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 02:57:28,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 02:57:28,237 INFO L87 Difference]: Start difference. First operand 89 states and 128 transitions. Second operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:57:28,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 02:57:28,258 INFO L93 Difference]: Finished difference Result 93 states and 131 transitions. [2022-07-12 02:57:28,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 02:57:28,259 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-12 02:57:28,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 02:57:28,260 INFO L225 Difference]: With dead ends: 93 [2022-07-12 02:57:28,261 INFO L226 Difference]: Without dead ends: 89 [2022-07-12 02:57:28,261 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 02:57:28,262 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 0 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 656 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 78 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 02:57:28,263 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 656 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 78 Unchecked, 0.0s Time] [2022-07-12 02:57:28,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-07-12 02:57:28,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2022-07-12 02:57:28,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 82 states have (on average 1.451219512195122) internal successors, (119), 82 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-12 02:57:28,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 127 transitions. [2022-07-12 02:57:28,274 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 127 transitions. Word has length 12 [2022-07-12 02:57:28,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 02:57:28,275 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 127 transitions. [2022-07-12 02:57:28,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:57:28,275 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 127 transitions. [2022-07-12 02:57:28,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-12 02:57:28,276 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 02:57:28,276 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 02:57:28,306 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-12 02:57:28,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 02:57:28,493 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 02:57:28,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 02:57:28,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1174160583, now seen corresponding path program 1 times [2022-07-12 02:57:28,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 02:57:28,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1523599728] [2022-07-12 02:57:28,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 02:57:28,495 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 02:57:28,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 02:57:28,497 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 02:57:28,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-12 02:57:28,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 02:57:28,965 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-12 02:57:28,967 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 02:57:31,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 02:57:31,256 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 02:57:31,257 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 02:57:31,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1523599728] [2022-07-12 02:57:31,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1523599728] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 02:57:31,257 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 02:57:31,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 02:57:31,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285623033] [2022-07-12 02:57:31,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 02:57:31,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 02:57:31,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 02:57:31,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 02:57:31,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 02:57:31,259 INFO L87 Difference]: Start difference. First operand 89 states and 127 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:57:31,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 02:57:31,281 INFO L93 Difference]: Finished difference Result 97 states and 133 transitions. [2022-07-12 02:57:31,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 02:57:31,282 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-07-12 02:57:31,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 02:57:31,285 INFO L225 Difference]: With dead ends: 97 [2022-07-12 02:57:31,287 INFO L226 Difference]: Without dead ends: 91 [2022-07-12 02:57:31,288 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 02:57:31,289 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 16 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 14 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 02:57:31,289 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 445 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 14 Unchecked, 0.0s Time] [2022-07-12 02:57:31,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-07-12 02:57:31,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 87. [2022-07-12 02:57:31,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 80 states have (on average 1.4375) internal successors, (115), 80 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-12 02:57:31,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 123 transitions. [2022-07-12 02:57:31,299 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 123 transitions. Word has length 17 [2022-07-12 02:57:31,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 02:57:31,300 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 123 transitions. [2022-07-12 02:57:31,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:57:31,300 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 123 transitions. [2022-07-12 02:57:31,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-12 02:57:31,301 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 02:57:31,301 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 02:57:31,323 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-12 02:57:31,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 02:57:31,508 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 02:57:31,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 02:57:31,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1166643321, now seen corresponding path program 1 times [2022-07-12 02:57:31,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 02:57:31,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1779197661] [2022-07-12 02:57:31,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 02:57:31,509 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 02:57:31,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 02:57:31,511 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 02:57:31,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-12 02:57:31,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 02:57:31,954 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-12 02:57:31,956 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 02:57:33,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 02:57:33,756 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 02:57:33,756 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 02:57:33,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1779197661] [2022-07-12 02:57:33,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1779197661] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 02:57:33,756 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 02:57:33,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 02:57:33,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766491167] [2022-07-12 02:57:33,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 02:57:33,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 02:57:33,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 02:57:33,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 02:57:33,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 02:57:33,758 INFO L87 Difference]: Start difference. First operand 87 states and 123 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:57:33,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 02:57:33,784 INFO L93 Difference]: Finished difference Result 159 states and 223 transitions. [2022-07-12 02:57:33,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 02:57:33,785 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-07-12 02:57:33,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 02:57:33,786 INFO L225 Difference]: With dead ends: 159 [2022-07-12 02:57:33,786 INFO L226 Difference]: Without dead ends: 85 [2022-07-12 02:57:33,787 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 02:57:33,788 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 5 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 15 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 02:57:33,788 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 421 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 15 Unchecked, 0.0s Time] [2022-07-12 02:57:33,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-07-12 02:57:33,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 81. [2022-07-12 02:57:33,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 74 states have (on average 1.4054054054054055) internal successors, (104), 74 states have internal predecessors, (104), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-12 02:57:33,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 112 transitions. [2022-07-12 02:57:33,796 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 112 transitions. Word has length 17 [2022-07-12 02:57:33,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 02:57:33,797 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 112 transitions. [2022-07-12 02:57:33,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:57:33,797 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 112 transitions. [2022-07-12 02:57:33,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-12 02:57:33,798 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 02:57:33,798 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 02:57:33,816 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-12 02:57:34,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 02:57:34,001 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 02:57:34,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 02:57:34,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1721131170, now seen corresponding path program 1 times [2022-07-12 02:57:34,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 02:57:34,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1972818114] [2022-07-12 02:57:34,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 02:57:34,003 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 02:57:34,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 02:57:34,004 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 02:57:34,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-12 02:57:34,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 02:57:34,455 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-12 02:57:34,466 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 02:57:36,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 02:57:36,572 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 02:57:36,573 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 02:57:36,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1972818114] [2022-07-12 02:57:36,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1972818114] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 02:57:36,573 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 02:57:36,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 02:57:36,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783803145] [2022-07-12 02:57:36,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 02:57:36,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 02:57:36,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 02:57:36,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 02:57:36,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 02:57:36,578 INFO L87 Difference]: Start difference. First operand 81 states and 112 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:57:36,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 02:57:36,595 INFO L93 Difference]: Finished difference Result 141 states and 191 transitions. [2022-07-12 02:57:36,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 02:57:36,596 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-07-12 02:57:36,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 02:57:36,597 INFO L225 Difference]: With dead ends: 141 [2022-07-12 02:57:36,600 INFO L226 Difference]: Without dead ends: 81 [2022-07-12 02:57:36,602 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 02:57:36,603 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 6 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 14 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 02:57:36,606 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 370 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 14 Unchecked, 0.0s Time] [2022-07-12 02:57:36,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-07-12 02:57:36,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 76. [2022-07-12 02:57:36,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 69 states have (on average 1.3623188405797102) internal successors, (94), 69 states have internal predecessors, (94), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-12 02:57:36,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 102 transitions. [2022-07-12 02:57:36,615 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 102 transitions. Word has length 18 [2022-07-12 02:57:36,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 02:57:36,615 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 102 transitions. [2022-07-12 02:57:36,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:57:36,616 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 102 transitions. [2022-07-12 02:57:36,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-12 02:57:36,617 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 02:57:36,617 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 02:57:36,636 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Ended with exit code 0 [2022-07-12 02:57:36,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 02:57:36,829 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 02:57:36,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 02:57:36,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1698251682, now seen corresponding path program 1 times [2022-07-12 02:57:36,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 02:57:36,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [497726128] [2022-07-12 02:57:36,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 02:57:36,831 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 02:57:36,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 02:57:36,832 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 02:57:36,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-12 02:57:37,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 02:57:37,299 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-12 02:57:37,301 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 02:57:40,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 02:57:40,425 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 02:57:40,425 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 02:57:40,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [497726128] [2022-07-12 02:57:40,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [497726128] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 02:57:40,426 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 02:57:40,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 02:57:40,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944259674] [2022-07-12 02:57:40,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 02:57:40,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 02:57:40,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 02:57:40,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 02:57:40,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 02:57:40,428 INFO L87 Difference]: Start difference. First operand 76 states and 102 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:57:42,374 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-12 02:57:44,551 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-12 02:57:44,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 02:57:44,632 INFO L93 Difference]: Finished difference Result 93 states and 123 transitions. [2022-07-12 02:57:44,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 02:57:44,632 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-07-12 02:57:44,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 02:57:44,633 INFO L225 Difference]: With dead ends: 93 [2022-07-12 02:57:44,633 INFO L226 Difference]: Without dead ends: 89 [2022-07-12 02:57:44,634 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 02:57:44,634 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 14 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 18 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-07-12 02:57:44,635 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 463 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 1 Unknown, 18 Unchecked, 4.2s Time] [2022-07-12 02:57:44,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-07-12 02:57:44,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 76. [2022-07-12 02:57:44,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 69 states have (on average 1.3478260869565217) internal successors, (93), 69 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-12 02:57:44,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 101 transitions. [2022-07-12 02:57:44,643 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 101 transitions. Word has length 18 [2022-07-12 02:57:44,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 02:57:44,650 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 101 transitions. [2022-07-12 02:57:44,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:57:44,650 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 101 transitions. [2022-07-12 02:57:44,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-12 02:57:44,651 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 02:57:44,651 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 02:57:44,688 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-07-12 02:57:44,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 02:57:44,869 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 02:57:44,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 02:57:44,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1104553500, now seen corresponding path program 1 times [2022-07-12 02:57:44,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 02:57:44,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [187855484] [2022-07-12 02:57:44,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 02:57:44,874 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 02:57:44,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 02:57:44,876 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 02:57:44,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-12 02:57:45,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 02:57:45,459 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-12 02:57:45,461 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 02:57:49,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 02:57:49,904 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 02:57:49,905 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 02:57:49,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [187855484] [2022-07-12 02:57:49,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [187855484] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 02:57:49,905 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 02:57:49,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 02:57:49,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074881632] [2022-07-12 02:57:49,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 02:57:49,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 02:57:49,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 02:57:49,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 02:57:49,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-12 02:57:49,907 INFO L87 Difference]: Start difference. First operand 76 states and 101 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:57:51,282 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-12 02:57:52,649 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-12 02:57:52,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 02:57:52,727 INFO L93 Difference]: Finished difference Result 93 states and 122 transitions. [2022-07-12 02:57:52,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 02:57:52,744 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-07-12 02:57:52,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 02:57:52,745 INFO L225 Difference]: With dead ends: 93 [2022-07-12 02:57:52,745 INFO L226 Difference]: Without dead ends: 89 [2022-07-12 02:57:52,745 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-12 02:57:52,746 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 14 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 21 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-07-12 02:57:52,746 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 444 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 21 Unchecked, 2.8s Time] [2022-07-12 02:57:52,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-07-12 02:57:52,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 76. [2022-07-12 02:57:52,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 69 states have (on average 1.3333333333333333) internal successors, (92), 69 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-12 02:57:52,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 100 transitions. [2022-07-12 02:57:52,756 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 100 transitions. Word has length 19 [2022-07-12 02:57:52,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 02:57:52,756 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 100 transitions. [2022-07-12 02:57:52,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:57:52,756 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 100 transitions. [2022-07-12 02:57:52,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-12 02:57:52,757 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 02:57:52,757 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 02:57:52,777 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-07-12 02:57:52,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 02:57:52,963 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 02:57:52,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 02:57:52,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1576098362, now seen corresponding path program 1 times [2022-07-12 02:57:52,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 02:57:52,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [368926664] [2022-07-12 02:57:52,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 02:57:52,964 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 02:57:52,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 02:57:52,966 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 02:57:52,968 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-07-12 02:57:53,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 02:57:53,505 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-12 02:57:53,507 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 02:57:55,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 02:57:55,731 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 02:57:55,732 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 02:57:55,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [368926664] [2022-07-12 02:57:55,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [368926664] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 02:57:55,732 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 02:57:55,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 02:57:55,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81104839] [2022-07-12 02:57:55,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 02:57:55,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 02:57:55,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 02:57:55,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 02:57:55,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 02:57:55,733 INFO L87 Difference]: Start difference. First operand 76 states and 100 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:57:55,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 02:57:55,738 INFO L93 Difference]: Finished difference Result 135 states and 177 transitions. [2022-07-12 02:57:55,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 02:57:55,738 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-07-12 02:57:55,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 02:57:55,739 INFO L225 Difference]: With dead ends: 135 [2022-07-12 02:57:55,739 INFO L226 Difference]: Without dead ends: 80 [2022-07-12 02:57:55,739 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 02:57:55,740 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 5 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 13 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 02:57:55,740 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 367 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 13 Unchecked, 0.0s Time] [2022-07-12 02:57:55,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-07-12 02:57:55,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 76. [2022-07-12 02:57:55,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 69 states have (on average 1.318840579710145) internal successors, (91), 69 states have internal predecessors, (91), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-12 02:57:55,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 99 transitions. [2022-07-12 02:57:55,747 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 99 transitions. Word has length 19 [2022-07-12 02:57:55,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 02:57:55,748 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 99 transitions. [2022-07-12 02:57:55,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:57:55,748 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 99 transitions. [2022-07-12 02:57:55,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-12 02:57:55,749 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 02:57:55,749 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 02:57:55,772 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-07-12 02:57:55,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 02:57:55,964 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 02:57:55,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 02:57:55,964 INFO L85 PathProgramCache]: Analyzing trace with hash -120072003, now seen corresponding path program 1 times [2022-07-12 02:57:55,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 02:57:55,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2141692642] [2022-07-12 02:57:55,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 02:57:55,965 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 02:57:55,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 02:57:55,967 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 02:57:55,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-07-12 02:57:56,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 02:57:56,473 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-12 02:57:56,475 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 02:57:56,928 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 16 [2022-07-12 02:57:58,033 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-07-12 02:58:03,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 02:58:03,587 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 02:58:03,587 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 02:58:03,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2141692642] [2022-07-12 02:58:03,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2141692642] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 02:58:03,587 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 02:58:03,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 02:58:03,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60060537] [2022-07-12 02:58:03,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 02:58:03,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 02:58:03,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 02:58:03,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 02:58:03,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-12 02:58:03,589 INFO L87 Difference]: Start difference. First operand 76 states and 99 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:58:03,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 02:58:03,626 INFO L93 Difference]: Finished difference Result 80 states and 102 transitions. [2022-07-12 02:58:03,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 02:58:03,627 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-07-12 02:58:03,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 02:58:03,629 INFO L225 Difference]: With dead ends: 80 [2022-07-12 02:58:03,629 INFO L226 Difference]: Without dead ends: 76 [2022-07-12 02:58:03,631 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-12 02:58:03,633 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 0 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 43 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 02:58:03,633 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 565 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 43 Unchecked, 0.0s Time] [2022-07-12 02:58:03,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-07-12 02:58:03,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2022-07-12 02:58:03,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 69 states have (on average 1.3043478260869565) internal successors, (90), 69 states have internal predecessors, (90), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-12 02:58:03,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 98 transitions. [2022-07-12 02:58:03,643 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 98 transitions. Word has length 20 [2022-07-12 02:58:03,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 02:58:03,643 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 98 transitions. [2022-07-12 02:58:03,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:58:03,643 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 98 transitions. [2022-07-12 02:58:03,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-12 02:58:03,645 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 02:58:03,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, 1] [2022-07-12 02:58:03,667 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-07-12 02:58:03,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 02:58:03,846 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 02:58:03,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 02:58:03,846 INFO L85 PathProgramCache]: Analyzing trace with hash 571392023, now seen corresponding path program 1 times [2022-07-12 02:58:03,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 02:58:03,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [250938418] [2022-07-12 02:58:03,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 02:58:03,847 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 02:58:03,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 02:58:03,849 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 02:58:03,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-07-12 02:58:04,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 02:58:04,350 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-12 02:58:04,351 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 02:58:21,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 02:58:21,290 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 02:58:21,290 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 02:58:21,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [250938418] [2022-07-12 02:58:21,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [250938418] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 02:58:21,290 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 02:58:21,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 02:58:21,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818348308] [2022-07-12 02:58:21,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 02:58:21,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 02:58:21,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 02:58:21,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 02:58:21,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 02:58:21,292 INFO L87 Difference]: Start difference. First operand 76 states and 98 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 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-12 02:58:33,488 WARN L233 SmtUtils]: Spent 5.25s on a formula simplification that was a NOOP. DAG size: 21 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 02:58:38,299 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-12 02:58:41,418 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-12 02:58:43,425 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-12 02:58:45,437 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-12 02:58:47,703 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.27s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 02:58:49,714 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 02:58:51,724 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 02:58:53,158 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-12 02:58:57,151 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-12 02:58:59,174 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-12 02:59:02,575 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-12 02:59:04,658 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-12 02:59:07,483 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-12 02:59:10,444 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.96s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-12 02:59:13,314 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.87s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-12 02:59:16,257 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.94s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-12 02:59:19,325 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.67s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-12 02:59:21,336 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-12 02:59:21,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 02:59:21,849 INFO L93 Difference]: Finished difference Result 87 states and 108 transitions. [2022-07-12 02:59:21,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 02:59:21,850 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 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-12 02:59:21,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 02:59:21,852 INFO L225 Difference]: With dead ends: 87 [2022-07-12 02:59:21,852 INFO L226 Difference]: Without dead ends: 83 [2022-07-12 02:59:21,852 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.5s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-12 02:59:21,853 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 72 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 16 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 48.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 16 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 50.9s IncrementalHoareTripleChecker+Time [2022-07-12 02:59:21,853 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 217 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 16 Unknown, 0 Unchecked, 50.9s Time] [2022-07-12 02:59:21,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-07-12 02:59:21,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 76. [2022-07-12 02:59:21,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 69 states have (on average 1.289855072463768) internal successors, (89), 69 states have internal predecessors, (89), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-12 02:59:21,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 97 transitions. [2022-07-12 02:59:21,869 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 97 transitions. Word has length 21 [2022-07-12 02:59:21,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 02:59:21,870 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 97 transitions. [2022-07-12 02:59:21,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 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-12 02:59:21,870 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 97 transitions. [2022-07-12 02:59:21,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-12 02:59:21,871 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 02:59:21,871 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] [2022-07-12 02:59:21,894 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-07-12 02:59:22,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 02:59:22,076 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 02:59:22,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 02:59:22,076 INFO L85 PathProgramCache]: Analyzing trace with hash 152585799, now seen corresponding path program 1 times [2022-07-12 02:59:22,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 02:59:22,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1494395375] [2022-07-12 02:59:22,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 02:59:22,077 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 02:59:22,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 02:59:22,078 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 02:59:22,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-07-12 02:59:22,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 02:59:22,487 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-12 02:59:22,489 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 02:59:24,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 02:59:24,036 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 02:59:24,036 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 02:59:24,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1494395375] [2022-07-12 02:59:24,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1494395375] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 02:59:24,037 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 02:59:24,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 02:59:24,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709903190] [2022-07-12 02:59:24,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 02:59:24,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 02:59:24,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 02:59:24,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 02:59:24,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 02:59:24,038 INFO L87 Difference]: Start difference. First operand 76 states and 97 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 02:59:24,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 02:59:24,042 INFO L93 Difference]: Finished difference Result 112 states and 142 transitions. [2022-07-12 02:59:24,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 02:59:24,042 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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 25 [2022-07-12 02:59:24,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 02:59:24,043 INFO L225 Difference]: With dead ends: 112 [2022-07-12 02:59:24,043 INFO L226 Difference]: Without dead ends: 74 [2022-07-12 02:59:24,043 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 02:59:24,044 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 0 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 7 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 02:59:24,044 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 260 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 7 Unchecked, 0.0s Time] [2022-07-12 02:59:24,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-07-12 02:59:24,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2022-07-12 02:59:24,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 68 states have (on average 1.2794117647058822) internal successors, (87), 68 states have internal predecessors, (87), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 02:59:24,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 93 transitions. [2022-07-12 02:59:24,050 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 93 transitions. Word has length 25 [2022-07-12 02:59:24,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 02:59:24,050 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 93 transitions. [2022-07-12 02:59:24,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 02:59:24,050 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 93 transitions. [2022-07-12 02:59:24,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-12 02:59:24,053 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 02:59:24,054 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] [2022-07-12 02:59:24,075 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Ended with exit code 0 [2022-07-12 02:59:24,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 02:59:24,268 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 02:59:24,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 02:59:24,268 INFO L85 PathProgramCache]: Analyzing trace with hash 26104402, now seen corresponding path program 1 times [2022-07-12 02:59:24,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 02:59:24,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1499650726] [2022-07-12 02:59:24,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 02:59:24,269 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 02:59:24,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 02:59:24,270 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 02:59:24,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-07-12 02:59:24,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 02:59:24,689 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-12 02:59:24,691 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 02:59:25,233 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 16 [2022-07-12 02:59:26,473 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-07-12 02:59:30,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 02:59:30,548 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 02:59:30,548 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 02:59:30,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1499650726] [2022-07-12 02:59:30,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1499650726] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 02:59:30,549 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 02:59:30,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 02:59:30,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651391025] [2022-07-12 02:59:30,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 02:59:30,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 02:59:30,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 02:59:30,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 02:59:30,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 02:59:30,550 INFO L87 Difference]: Start difference. First operand 74 states and 93 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:59:30,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 02:59:30,590 INFO L93 Difference]: Finished difference Result 74 states and 93 transitions. [2022-07-12 02:59:30,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 02:59:30,592 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 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 25 [2022-07-12 02:59:30,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 02:59:30,592 INFO L225 Difference]: With dead ends: 74 [2022-07-12 02:59:30,592 INFO L226 Difference]: Without dead ends: 0 [2022-07-12 02:59:30,592 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 02:59:30,593 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 0 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 13 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 02:59:30,593 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 13 Unchecked, 0.0s Time] [2022-07-12 02:59:30,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-12 02:59:30,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-12 02:59:30,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:59:30,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-12 02:59:30,593 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2022-07-12 02:59:30,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 02:59:30,594 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-12 02:59:30,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:59:30,594 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-12 02:59:30,594 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-12 02:59:30,596 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-12 02:59:30,620 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Ended with exit code 0 [2022-07-12 02:59:30,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 02:59:30,809 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-12 02:59:36,146 INFO L899 garLoopResultBuilder]: For program point L26(lines 26 31) no Hoare annotation was computed. [2022-07-12 02:59:36,147 INFO L899 garLoopResultBuilder]: For program point L26-1(lines 19 33) no Hoare annotation was computed. [2022-07-12 02:59:36,147 INFO L899 garLoopResultBuilder]: For program point fabs_doubleEXIT(lines 19 33) no Hoare annotation was computed. [2022-07-12 02:59:36,147 INFO L899 garLoopResultBuilder]: For program point L26-2(lines 26 31) no Hoare annotation was computed. [2022-07-12 02:59:36,147 INFO L902 garLoopResultBuilder]: At program point fabs_doubleENTRY(lines 19 33) the Hoare annotation is: true [2022-07-12 02:59:36,147 INFO L899 garLoopResultBuilder]: For program point L21-1(lines 21 25) no Hoare annotation was computed. [2022-07-12 02:59:36,147 INFO L902 garLoopResultBuilder]: At program point L21-2(lines 21 25) the Hoare annotation is: true [2022-07-12 02:59:36,147 INFO L899 garLoopResultBuilder]: For program point fabs_doubleFINAL(lines 19 33) no Hoare annotation was computed. [2022-07-12 02:59:36,147 INFO L902 garLoopResultBuilder]: At program point L97(line 97) the Hoare annotation is: true [2022-07-12 02:59:36,147 INFO L899 garLoopResultBuilder]: For program point L97-1(line 97) no Hoare annotation was computed. [2022-07-12 02:59:36,147 INFO L899 garLoopResultBuilder]: For program point L85(lines 85 88) no Hoare annotation was computed. [2022-07-12 02:59:36,147 INFO L899 garLoopResultBuilder]: For program point L98(lines 98 114) no Hoare annotation was computed. [2022-07-12 02:59:36,147 INFO L899 garLoopResultBuilder]: For program point L90(lines 90 115) no Hoare annotation was computed. [2022-07-12 02:59:36,148 INFO L899 garLoopResultBuilder]: For program point L78-1(lines 78 82) no Hoare annotation was computed. [2022-07-12 02:59:36,148 INFO L902 garLoopResultBuilder]: At program point L78-2(lines 78 82) the Hoare annotation is: true [2022-07-12 02:59:36,148 INFO L899 garLoopResultBuilder]: For program point L78-3(lines 76 89) no Hoare annotation was computed. [2022-07-12 02:59:36,148 INFO L899 garLoopResultBuilder]: For program point L107(lines 107 113) no Hoare annotation was computed. [2022-07-12 02:59:36,148 INFO L899 garLoopResultBuilder]: For program point L107-2(lines 90 115) no Hoare annotation was computed. [2022-07-12 02:59:36,148 INFO L899 garLoopResultBuilder]: For program point L70-1(lines 70 74) no Hoare annotation was computed. [2022-07-12 02:59:36,148 INFO L902 garLoopResultBuilder]: At program point L70-2(lines 70 74) the Hoare annotation is: true [2022-07-12 02:59:36,148 INFO L899 garLoopResultBuilder]: For program point L132(line 132) no Hoare annotation was computed. [2022-07-12 02:59:36,148 INFO L899 garLoopResultBuilder]: For program point L70-3(lines 70 74) no Hoare annotation was computed. [2022-07-12 02:59:36,148 INFO L899 garLoopResultBuilder]: For program point L99(lines 99 105) no Hoare annotation was computed. [2022-07-12 02:59:36,148 INFO L899 garLoopResultBuilder]: For program point L132-2(line 132) no Hoare annotation was computed. [2022-07-12 02:59:36,148 INFO L899 garLoopResultBuilder]: For program point L128(lines 128 133) no Hoare annotation was computed. [2022-07-12 02:59:36,148 INFO L899 garLoopResultBuilder]: For program point L91(lines 91 94) no Hoare annotation was computed. [2022-07-12 02:59:36,148 INFO L899 garLoopResultBuilder]: For program point L91-2(lines 91 94) no Hoare annotation was computed. [2022-07-12 02:59:36,148 INFO L899 garLoopResultBuilder]: For program point atan_doubleEXIT(lines 66 134) no Hoare annotation was computed. [2022-07-12 02:59:36,148 INFO L899 garLoopResultBuilder]: For program point L92(lines 92 93) no Hoare annotation was computed. [2022-07-12 02:59:36,148 INFO L902 garLoopResultBuilder]: At program point atan_doubleENTRY(lines 66 134) the Hoare annotation is: true [2022-07-12 02:59:36,148 INFO L899 garLoopResultBuilder]: For program point L76(lines 76 89) no Hoare annotation was computed. [2022-07-12 02:59:36,148 INFO L899 garLoopResultBuilder]: For program point atan_doubleFINAL(lines 66 134) no Hoare annotation was computed. [2022-07-12 02:59:36,149 INFO L899 garLoopResultBuilder]: For program point L192(line 192) no Hoare annotation was computed. [2022-07-12 02:59:36,149 INFO L899 garLoopResultBuilder]: For program point L217(lines 217 220) no Hoare annotation was computed. [2022-07-12 02:59:36,149 INFO L899 garLoopResultBuilder]: For program point L217-2(lines 215 220) no Hoare annotation was computed. [2022-07-12 02:59:36,149 INFO L899 garLoopResultBuilder]: For program point L201(line 201) no Hoare annotation was computed. [2022-07-12 02:59:36,149 INFO L899 garLoopResultBuilder]: For program point L259(lines 259 262) no Hoare annotation was computed. [2022-07-12 02:59:36,149 INFO L899 garLoopResultBuilder]: For program point L226-1(lines 226 230) no Hoare annotation was computed. [2022-07-12 02:59:36,149 INFO L895 garLoopResultBuilder]: At program point L226-2(lines 226 230) the Hoare annotation is: false [2022-07-12 02:59:36,149 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-12 02:59:36,149 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-12 02:59:36,149 INFO L899 garLoopResultBuilder]: For program point L185(lines 185 209) no Hoare annotation was computed. [2022-07-12 02:59:36,149 INFO L899 garLoopResultBuilder]: For program point L185-1(lines 144 244) no Hoare annotation was computed. [2022-07-12 02:59:36,149 INFO L899 garLoopResultBuilder]: For program point L177(line 177) no Hoare annotation was computed. [2022-07-12 02:59:36,149 INFO L895 garLoopResultBuilder]: At program point L144(lines 144 244) the Hoare annotation is: (let ((.cse0 ((_ to_fp 11 53) currentRoundingMode (/ 1.0 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0)))) (and (= .cse0 ~tiny_atan2~0) (= |ULTIMATE.start___ieee754_atan2_#res#1| (fp.sub currentRoundingMode (fp.mul currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 3.0)) ~pi_o_4~0) .cse0)) (= ~pi_o_4~0 ((_ to_fp 11 53) currentRoundingMode (/ 785398163397448279.0 1000000000000000000.0))) (= currentRoundingMode roundNearestTiesToEven))) [2022-07-12 02:59:36,149 INFO L899 garLoopResultBuilder]: For program point L260(line 260) no Hoare annotation was computed. [2022-07-12 02:59:36,149 INFO L899 garLoopResultBuilder]: For program point L194(line 194) no Hoare annotation was computed. [2022-07-12 02:59:36,150 INFO L899 garLoopResultBuilder]: For program point L186(lines 186 208) no Hoare annotation was computed. [2022-07-12 02:59:36,150 INFO L899 garLoopResultBuilder]: For program point L203(line 203) no Hoare annotation was computed. [2022-07-12 02:59:36,150 INFO L899 garLoopResultBuilder]: For program point L170(lines 170 180) no Hoare annotation was computed. [2022-07-12 02:59:36,150 INFO L899 garLoopResultBuilder]: For program point L170-2(lines 144 244) no Hoare annotation was computed. [2022-07-12 02:59:36,150 INFO L895 garLoopResultBuilder]: At program point L220(line 220) the Hoare annotation is: false [2022-07-12 02:59:36,150 INFO L899 garLoopResultBuilder]: For program point L187(lines 187 196) no Hoare annotation was computed. [2022-07-12 02:59:36,150 INFO L895 garLoopResultBuilder]: At program point L220-1(line 220) the Hoare annotation is: false [2022-07-12 02:59:36,150 INFO L899 garLoopResultBuilder]: For program point L220-2(line 220) no Hoare annotation was computed. [2022-07-12 02:59:36,150 INFO L899 garLoopResultBuilder]: For program point L212(line 212) no Hoare annotation was computed. [2022-07-12 02:59:36,150 INFO L899 garLoopResultBuilder]: For program point L212-2(line 212) no Hoare annotation was computed. [2022-07-12 02:59:36,150 INFO L899 garLoopResultBuilder]: For program point L171(lines 171 179) no Hoare annotation was computed. [2022-07-12 02:59:36,150 INFO L899 garLoopResultBuilder]: For program point L163(lines 163 165) no Hoare annotation was computed. [2022-07-12 02:59:36,150 INFO L899 garLoopResultBuilder]: For program point L221(lines 221 243) no Hoare annotation was computed. [2022-07-12 02:59:36,150 INFO L899 garLoopResultBuilder]: For program point L188(line 188) no Hoare annotation was computed. [2022-07-12 02:59:36,150 INFO L899 garLoopResultBuilder]: For program point L205(line 205) no Hoare annotation was computed. [2022-07-12 02:59:36,150 INFO L899 garLoopResultBuilder]: For program point L172(line 172) no Hoare annotation was computed. [2022-07-12 02:59:36,150 INFO L899 garLoopResultBuilder]: For program point L172-2(line 172) no Hoare annotation was computed. [2022-07-12 02:59:36,150 INFO L902 garLoopResultBuilder]: At program point L263(lines 246 264) the Hoare annotation is: true [2022-07-12 02:59:36,150 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-12 02:59:36,151 INFO L899 garLoopResultBuilder]: For program point L222(line 222) no Hoare annotation was computed. [2022-07-12 02:59:36,151 INFO L899 garLoopResultBuilder]: For program point L156-1(lines 156 161) no Hoare annotation was computed. [2022-07-12 02:59:36,151 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) (exists ((|v_skolemized_q#valueAsBitvector_23| (_ BitVec 64)) (|v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_6| (_ BitVec 32)) (currentRoundingMode RoundingMode)) (let ((.cse3 (select |#memory_int| |v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_6|))) (let ((.cse0 (select .cse3 (_ bv0 32))) (.cse1 (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53))) (.cse2 (select .cse3 (_ bv4 32)))) (and (= .cse0 |ULTIMATE.start___ieee754_atan2_~lx~0#1|) (= .cse0 ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_23|)) (= (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|)) .cse1) (= .cse2 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_23|)) (= |ULTIMATE.start___ieee754_atan2_~y#1| .cse1) (= |ULTIMATE.start___ieee754_atan2_~ix~1#1| (bvand (_ bv2147483647 32) .cse2)))))) (= ~pi_o_4~0 ((_ to_fp 11 53) currentRoundingMode (/ 785398163397448279.0 1000000000000000000.0))) (exists ((|v_skolemized_q#valueAsBitvector_62| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_62|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_62|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_62|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53))) (= |ULTIMATE.start___ieee754_atan2_~hx~1#1| ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_62|)))) (= currentRoundingMode roundNearestTiesToEven)) [2022-07-12 02:59:36,156 INFO L899 garLoopResultBuilder]: For program point L156-3(lines 156 161) no Hoare annotation was computed. [2022-07-12 02:59:36,156 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 260) no Hoare annotation was computed. [2022-07-12 02:59:36,156 INFO L899 garLoopResultBuilder]: For program point L239(line 239) no Hoare annotation was computed. [2022-07-12 02:59:36,157 INFO L899 garLoopResultBuilder]: For program point L173(line 173) no Hoare annotation was computed. [2022-07-12 02:59:36,157 INFO L899 garLoopResultBuilder]: For program point L231(lines 231 236) no Hoare annotation was computed. [2022-07-12 02:59:36,157 INFO L899 garLoopResultBuilder]: For program point L198(lines 198 207) no Hoare annotation was computed. [2022-07-12 02:59:36,157 INFO L899 garLoopResultBuilder]: For program point L231-1(lines 224 237) no Hoare annotation was computed. [2022-07-12 02:59:36,157 INFO L899 garLoopResultBuilder]: For program point L231-2(lines 231 236) no Hoare annotation was computed. [2022-07-12 02:59:36,157 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-12 02:59:36,157 INFO L899 garLoopResultBuilder]: For program point L190(line 190) no Hoare annotation was computed. [2022-07-12 02:59:36,157 INFO L899 garLoopResultBuilder]: For program point L215(lines 215 220) no Hoare annotation was computed. [2022-07-12 02:59:36,158 INFO L899 garLoopResultBuilder]: For program point L149-1(lines 149 154) no Hoare annotation was computed. [2022-07-12 02:59:36,158 INFO L895 garLoopResultBuilder]: At program point L149-2(lines 149 154) the Hoare annotation is: (and (= ((_ to_fp 11 53) currentRoundingMode (/ 1.0 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0)) ~tiny_atan2~0) (exists ((currentRoundingMode RoundingMode)) (let ((.cse0 (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53)))) (and (= |ULTIMATE.start___ieee754_atan2_~x#1| .cse0) (= |ULTIMATE.start___ieee754_atan2_~y#1| .cse0)))) (= ~pi_o_4~0 ((_ to_fp 11 53) currentRoundingMode (/ 785398163397448279.0 1000000000000000000.0))) (= currentRoundingMode roundNearestTiesToEven)) [2022-07-12 02:59:36,158 INFO L899 garLoopResultBuilder]: For program point L149-3(lines 149 154) no Hoare annotation was computed. [2022-07-12 02:59:36,158 INFO L899 garLoopResultBuilder]: For program point L199(line 199) no Hoare annotation was computed. [2022-07-12 02:59:36,158 INFO L899 garLoopResultBuilder]: For program point L166(lines 166 167) no Hoare annotation was computed. [2022-07-12 02:59:36,158 INFO L899 garLoopResultBuilder]: For program point L224(line 224) no Hoare annotation was computed. [2022-07-12 02:59:36,159 INFO L899 garLoopResultBuilder]: For program point L183(line 183) no Hoare annotation was computed. [2022-07-12 02:59:36,160 INFO L899 garLoopResultBuilder]: For program point L183-2(line 183) no Hoare annotation was computed. [2022-07-12 02:59:36,160 INFO L899 garLoopResultBuilder]: For program point L241(line 241) no Hoare annotation was computed. [2022-07-12 02:59:36,160 INFO L899 garLoopResultBuilder]: For program point L175(line 175) no Hoare annotation was computed. [2022-07-12 02:59:36,161 INFO L895 garLoopResultBuilder]: At program point L167(line 167) the Hoare annotation is: false [2022-07-12 02:59:36,161 INFO L899 garLoopResultBuilder]: For program point L167-1(line 167) no Hoare annotation was computed. [2022-07-12 02:59:36,164 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 02:59:36,184 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-12 02:59:36,211 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:59:36,212 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:59:36,212 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:59:36,212 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:59:36,214 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 02:59:36,218 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:59:36,218 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:59:36,218 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:59:36,218 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:59:36,219 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 02:59:36,240 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-12 02:59:36,247 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-12 02:59:36,247 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_23,QUANTIFIED] [2022-07-12 02:59:36,247 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_23,QUANTIFIED] [2022-07-12 02:59:36,247 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_23,QUANTIFIED] [2022-07-12 02:59:36,247 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_23,QUANTIFIED] [2022-07-12 02:59:36,247 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:59:36,247 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:59:36,247 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-12 02:59:36,247 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_23,QUANTIFIED] [2022-07-12 02:59:36,248 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:59:36,248 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:59:36,248 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-12 02:59:36,248 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_62,QUANTIFIED] [2022-07-12 02:59:36,248 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_62,QUANTIFIED] [2022-07-12 02:59:36,248 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_62,QUANTIFIED] [2022-07-12 02:59:36,248 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:59:36,249 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:59:36,249 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_62,QUANTIFIED] [2022-07-12 02:59:36,249 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 02:59:36,250 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-12 02:59:36,250 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-12 02:59:36,250 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_23,QUANTIFIED] [2022-07-12 02:59:36,250 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_23,QUANTIFIED] [2022-07-12 02:59:36,250 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_23,QUANTIFIED] [2022-07-12 02:59:36,250 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_23,QUANTIFIED] [2022-07-12 02:59:36,250 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:59:36,251 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:59:36,251 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-12 02:59:36,251 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_23,QUANTIFIED] [2022-07-12 02:59:36,251 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:59:36,251 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:59:36,251 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-12 02:59:36,252 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_62,QUANTIFIED] [2022-07-12 02:59:36,252 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_62,QUANTIFIED] [2022-07-12 02:59:36,252 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_62,QUANTIFIED] [2022-07-12 02:59:36,252 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:59:36,252 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:59:36,252 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_62,QUANTIFIED] [2022-07-12 02:59:36,253 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 02:59:36,254 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 02:59:36,255 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 02:59:36,255 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.07 02:59:36 BoogieIcfgContainer [2022-07-12 02:59:36,256 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-12 02:59:36,256 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-12 02:59:36,256 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-12 02:59:36,257 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-12 02:59:36,257 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 02:57:21" (3/4) ... [2022-07-12 02:59:36,265 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-12 02:59:36,271 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fabs_double [2022-07-12 02:59:36,271 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure atan_double [2022-07-12 02:59:36,290 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 29 nodes and edges [2022-07-12 02:59:36,292 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2022-07-12 02:59:36,293 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-07-12 02:59:36,293 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-12 02:59:36,323 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) == tiny_atan2 && (\exists currentRoundingMode : FloatRoundingMode :: x == ~fp.div~DOUBLE(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE()) && y == ~fp.div~DOUBLE(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE()))) && pi_o_4 == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 785398163397448279/1000000000000000000)) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven [2022-07-12 02:59:36,324 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) == tiny_atan2 && (\exists v_skolemized_q#valueAsBitvector_23 : bv64, v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_6 : bv32, currentRoundingMode : FloatRoundingMode :: ((((unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_6][0bv32] == lx && unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_6][0bv32] == v_skolemized_q#valueAsBitvector_23[31:0]) && ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_23[63:63], v_skolemized_q#valueAsBitvector_23[62:52], v_skolemized_q#valueAsBitvector_23[51:0]) == ~fp.div~DOUBLE(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~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]) && y == ~fp.div~DOUBLE(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE())) && ix == ~bvand32(2147483647bv32, unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_6][4bv32]))) && pi_o_4 == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 785398163397448279/1000000000000000000)) && (\exists v_skolemized_q#valueAsBitvector_62 : bv64, currentRoundingMode : FloatRoundingMode :: ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_62[63:63], v_skolemized_q#valueAsBitvector_62[62:52], v_skolemized_q#valueAsBitvector_62[51:0]) == ~fp.div~DOUBLE(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE()) && hx == v_skolemized_q#valueAsBitvector_62[63:32])) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven [2022-07-12 02:59:36,325 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) == tiny_atan2 && \result == ~fp.sub~DOUBLE(unknown-currentRoundingMode-unknown, ~fp.mul~DOUBLE(unknown-currentRoundingMode-unknown, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 3.0)), pi_o_4), ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000))) && pi_o_4 == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 785398163397448279/1000000000000000000)) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven [2022-07-12 02:59:36,370 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-12 02:59:36,371 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-12 02:59:36,372 INFO L158 Benchmark]: Toolchain (without parser) took 159219.07ms. Allocated memory was 50.3MB in the beginning and 65.0MB in the end (delta: 14.7MB). Free memory was 26.5MB in the beginning and 36.4MB in the end (delta: -9.9MB). Peak memory consumption was 6.8MB. Max. memory is 16.1GB. [2022-07-12 02:59:36,372 INFO L158 Benchmark]: CDTParser took 0.37ms. Allocated memory is still 50.3MB. Free memory was 32.2MB in the beginning and 32.2MB in the end (delta: 31.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 02:59:36,372 INFO L158 Benchmark]: CACSL2BoogieTranslator took 454.34ms. Allocated memory was 50.3MB in the beginning and 65.0MB in the end (delta: 14.7MB). Free memory was 26.3MB in the beginning and 48.1MB in the end (delta: -21.8MB). Peak memory consumption was 7.3MB. Max. memory is 16.1GB. [2022-07-12 02:59:36,373 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.27ms. Allocated memory is still 65.0MB. Free memory was 47.9MB in the beginning and 45.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 02:59:36,373 INFO L158 Benchmark]: Boogie Preprocessor took 71.12ms. Allocated memory is still 65.0MB. Free memory was 45.5MB in the beginning and 42.8MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 02:59:36,374 INFO L158 Benchmark]: RCFGBuilder took 23486.45ms. Allocated memory is still 65.0MB. Free memory was 42.8MB in the beginning and 42.9MB in the end (delta: -124.9kB). Peak memory consumption was 16.2MB. Max. memory is 16.1GB. [2022-07-12 02:59:36,374 INFO L158 Benchmark]: TraceAbstraction took 135009.89ms. Allocated memory is still 65.0MB. Free memory was 42.4MB in the beginning and 42.3MB in the end (delta: 83.9kB). Peak memory consumption was 22.9MB. Max. memory is 16.1GB. [2022-07-12 02:59:36,374 INFO L158 Benchmark]: Witness Printer took 114.46ms. Allocated memory is still 65.0MB. Free memory was 42.3MB in the beginning and 36.4MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-12 02:59:36,380 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.37ms. Allocated memory is still 50.3MB. Free memory was 32.2MB in the beginning and 32.2MB in the end (delta: 31.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 454.34ms. Allocated memory was 50.3MB in the beginning and 65.0MB in the end (delta: 14.7MB). Free memory was 26.3MB in the beginning and 48.1MB in the end (delta: -21.8MB). Peak memory consumption was 7.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 73.27ms. Allocated memory is still 65.0MB. Free memory was 47.9MB in the beginning and 45.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 71.12ms. Allocated memory is still 65.0MB. Free memory was 45.5MB in the beginning and 42.8MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 23486.45ms. Allocated memory is still 65.0MB. Free memory was 42.8MB in the beginning and 42.9MB in the end (delta: -124.9kB). Peak memory consumption was 16.2MB. Max. memory is 16.1GB. * TraceAbstraction took 135009.89ms. Allocated memory is still 65.0MB. Free memory was 42.4MB in the beginning and 42.3MB in the end (delta: 83.9kB). Peak memory consumption was 22.9MB. Max. memory is 16.1GB. * Witness Printer took 114.46ms. Allocated memory is still 65.0MB. Free memory was 42.3MB in the beginning and 36.4MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_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_skolemized_q#valueAsBitvector_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_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[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_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_62,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_62,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_62,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_62,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_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_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_skolemized_q#valueAsBitvector_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_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[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_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_62,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_62,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_62,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_62,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 * 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: 260]: 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, 92 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 134.8s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 67.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 5.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 17 mSolverCounterUnknown, 142 SdHoareTripleChecker+Valid, 57.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 132 mSDsluCounter, 4375 SdHoareTripleChecker+Invalid, 55.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 236 IncrementalHoareTripleChecker+Unchecked, 3239 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 74 IncrementalHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 1136 mSDtfsCounter, 74 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 211 GetRequests, 166 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 29.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=92occurred in iteration=0, InterpolantAutomatonStates: 66, 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, 12 MinimizatonAttempts, 50 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 58 PreInvPairs, 62 NumberOfFragments, 166 HoareAnnotationTreeSize, 58 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 14 FomulaSimplificationsInter, 200 FormulaSimplificationTreeSizeReductionInter, 5.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 4.9s SatisfiabilityAnalysisTime, 53.1s InterpolantComputationTime, 221 NumberOfCodeBlocks, 221 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 209 ConstructedInterpolants, 111 QuantifiedInterpolants, 3504 SizeOfPredicates, 94 NumberOfNonLiveVariables, 1736 ConjunctsInSsa, 142 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 246]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 149]: Loop Invariant [2022-07-12 02:59:36,402 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:59:36,402 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:59:36,402 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:59:36,402 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:59:36,403 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 02:59:36,403 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:59:36,403 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:59:36,403 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:59:36,403 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:59:36,404 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 && (\exists currentRoundingMode : FloatRoundingMode :: x == ~fp.div~DOUBLE(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE()) && y == ~fp.div~DOUBLE(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE()))) && pi_o_4 == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 785398163397448279/1000000000000000000)) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven - InvariantResult [Line: 78]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 156]: Loop Invariant [2022-07-12 02:59:36,412 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-12 02:59:36,412 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-12 02:59:36,412 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_23,QUANTIFIED] [2022-07-12 02:59:36,413 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_23,QUANTIFIED] [2022-07-12 02:59:36,413 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_23,QUANTIFIED] [2022-07-12 02:59:36,413 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_23,QUANTIFIED] [2022-07-12 02:59:36,413 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:59:36,413 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:59:36,413 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-12 02:59:36,414 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_23,QUANTIFIED] [2022-07-12 02:59:36,414 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:59:36,414 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:59:36,414 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-12 02:59:36,414 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_62,QUANTIFIED] [2022-07-12 02:59:36,415 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_62,QUANTIFIED] [2022-07-12 02:59:36,415 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_62,QUANTIFIED] [2022-07-12 02:59:36,415 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:59:36,415 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:59:36,415 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_62,QUANTIFIED] [2022-07-12 02:59:36,415 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 02:59:36,416 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-12 02:59:36,417 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-12 02:59:36,417 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_23,QUANTIFIED] [2022-07-12 02:59:36,417 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_23,QUANTIFIED] [2022-07-12 02:59:36,417 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_23,QUANTIFIED] [2022-07-12 02:59:36,418 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_23,QUANTIFIED] [2022-07-12 02:59:36,418 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:59:36,418 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:59:36,418 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-12 02:59:36,418 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_23,QUANTIFIED] [2022-07-12 02:59:36,418 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:59:36,418 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:59:36,418 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-12 02:59:36,419 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_62,QUANTIFIED] [2022-07-12 02:59:36,419 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_62,QUANTIFIED] [2022-07-12 02:59:36,419 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_62,QUANTIFIED] [2022-07-12 02:59:36,419 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:59:36,419 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:59:36,419 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_62,QUANTIFIED] [2022-07-12 02:59:36,420 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 && (\exists v_skolemized_q#valueAsBitvector_23 : bv64, v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_6 : bv32, currentRoundingMode : FloatRoundingMode :: ((((unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_6][0bv32] == lx && unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_6][0bv32] == v_skolemized_q#valueAsBitvector_23[31:0]) && ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_23[63:63], v_skolemized_q#valueAsBitvector_23[62:52], v_skolemized_q#valueAsBitvector_23[51:0]) == ~fp.div~DOUBLE(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~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]) && y == ~fp.div~DOUBLE(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE())) && ix == ~bvand32(2147483647bv32, unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_atan2_~#ew_u~0#1.base_6][4bv32]))) && pi_o_4 == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 785398163397448279/1000000000000000000)) && (\exists v_skolemized_q#valueAsBitvector_62 : bv64, currentRoundingMode : FloatRoundingMode :: ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_62[63:63], v_skolemized_q#valueAsBitvector_62[62:52], v_skolemized_q#valueAsBitvector_62[51:0]) == ~fp.div~DOUBLE(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE()) && hx == v_skolemized_q#valueAsBitvector_62[63:32])) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven - 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-12 02:59:36,425 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 02:59:36,426 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ((~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) == tiny_atan2 && \result == ~fp.sub~DOUBLE(unknown-currentRoundingMode-unknown, ~fp.mul~DOUBLE(unknown-currentRoundingMode-unknown, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 3.0)), pi_o_4), ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000))) && pi_o_4 == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 785398163397448279/1000000000000000000)) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-07-12 02:59:36,659 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2022-07-12 02:59:36,786 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